On AFL generators for finitely encoded AFA

DOI10.1016/S0022-0000(73)80047-9zbMath0249.68025MaRDI QIDQ2556749

Seymour Ginsburg, Sheila A. Greibach

Publication date: 1973

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Single-tape reset machines ⋮ Two-way A-transducers and AFL ⋮ A generalization of Dijkstra's algorithm ⋮ One way finite visit automata ⋮ Classes of formal grammars ⋮ Remarks on blind and partially blind one-way multicounter machines ⋮ Générateurs algébriques et systèmes de paires iterantes

Cites Work

• Unnamed Item
• Checking automata and one-way stack languages
• Principal AFL
• A Grammatical Characterization of One-Way Nondeterministic Stack Languages
• Turing machines with restricted memory access
• Stack automata and compiling
• An Infinite Hierarchy of Context-Free Languages