论文信息 - On AFL Generators for Finitely Encoded AFA

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 h"1 and h"2 are homomorphisms, with h"2 nondecreasing.

Seymour Ginsburg | Sheila A. Greibach

[1] Seymour Ginsburg,et al. Abstract Families of Languages , 1967, SWAT.

[2] Seymour Ginsburg,et al. Principal AFL , 1970, J. Comput. Syst. Sci..

[3] Patrick C. Fischer,et al. Turing Machines with Restricted Memory Access , 1966, Inf. Control..

[4] Sheila A. Greibach,et al. Checking Automata and One-Way Stack Languages , 1969, J. Comput. Syst. Sci..

[5] Sheila A. Greibach,et al. An Infinite Hierarchy of Context-Free Languages , 1969, JACM.

[6] Seymour Ginsburg,et al. Stack automata and compiling , 1967, JACM.

[7] Michael A. Harrison,et al. A Grammatical Characterization of One-Way Nondeterministic Stack Languages , 1971, JACM.