On AFL generators for finitely encoded AFA

DOI10.1016/S0022-0000(73)80047-9MaRDI QIDQ2556749zbMATH OpenFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 3483582 (Why is no real title available?)
• A Grammatical Characterization of One-Way Nondeterministic Stack Languages
• An Infinite Hierarchy of Context-Free Languages
• Checking automata and one-way stack languages
• Principal AFL
• Stack automata and compiling
• Turing machines with restricted memory access

Cited in

(7)

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

This page was built for publication: On AFL generators for finitely encoded AFA

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2556749)