Deterministic stack automata and the quotient operator

DOI10.1016/S0022-0000(68)80003-0MaRDI QIDQ2531282zbMATH OpenFDO

Authors John Hopcroft, Jeffrey D. Ullman

Publication date 1968

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(68)80003-0

zbMATH Keywords

languages, automata, networks

Cites work

• An Approach to a Unified Theory of Automata
• Deterministic context free languages
• Nonerasing stack automata
• One-way stack automata
• Stack automata and compiling

Cited in

(11)

• Superdeterministic DPDAs: The method of accepting does affect decision problems
• 1-way stack automaton with jumps
• Stack languages and log n space
• On store languages of language acceptors
• Checking automata and one-way stack languages
• Tree-walking-storage automata
• Deterministic tree-walking-storage automata
• Left quotients of deterministic context-free languages
• Deterministic real-time tree-walking-storage automata
• Deterministic real-time tree-walking-storage automata
• Store languages of Turing machines and counter machines

This page was built for publication: Deterministic stack automata and the quotient operator

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