A characterization of two-way deterministic classes of languages

DOI10.1016/S0022-0000(70)80027-7zbMATH Open0222.68034OpenAlexW2001907947MaRDI QIDQ2547802FDOQ2547802

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

• Title not available (Why is that?)
• Two-way pushdown automata
• An Approach to a Unified Theory of Automata
• Studies in abstract families of languages
• Abstract families of deterministic languages
• Two-way balloon automata and AFL
• Abstract families of processors

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
• Title not available (Why is that?)
• Two-way A-transducers and AFL
• Tree transducers, L systems, and two-way machines
• Three hierarchies of transducers
• Hierarchies of hyper-AFLs
• 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)