A characterization of two-way deterministic classes of languages

DOI10.1016/S0022-0000(70)80027-7MaRDI QIDQ2547802zbMATH OpenOpenAlexFDO

Authors A. V. Aho, Jeffrey D. Ullman

Publication date 1970

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

Full work available at URL https://doi.org/10.1016/s0022-0000(70)80027-7

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• scientific article; zbMATH DE number 3254906 (Why is no real title available?)
• Abstract families of deterministic languages
• Abstract families of processors
• An Approach to a Unified Theory of Automata
• Studies in abstract families of languages
• Two-way balloon automata and AFL
• Two-way pushdown automata

Cited in

(10)

• The power of two-way deterministic checking stack automata
• Classes of formal grammars
• The Dyck language \(D_ 1^{'*}\) is not generated by any matrix grammar of finite index
• Absolutely parallel grammars and two-way finite-state transducers
• scientific article; zbMATH DE number 7444013 (Why is no real title available?)
• Two-way A-transducers and AFL
• Tree transducers, L systems, and two-way machines
• Hierarchies of hyper-AFLs
• Three hierarchies of transducers
• Characterizations of transductions defined by abstract families of transducers

This page was built for publication: A characterization of two-way deterministic classes of languages

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