On AFL generators for finitely encoded AFA

Two languages, and , are introduced for each finitely encoded AFA . Then two conditions on are presented, each of which guarantees that and are generators for the AFL defined by . Using and , generators are exhibited for a number of well-known AFL in computer science. Finally, it is shown that each of the above conditions, in conjunction with a third condition, permits every language in the AFL defined by to have a representation in the form , where R is a regular set and h1 and h2 are homomorphisms, with h2 nondecreasing