Deterministic stack automata and the quotient operator

DOI10.1016/S0022-0000(68)80003-0zbMath0169.31303MaRDI QIDQ2531282

John E. Hopcrofts, Jeffrey D. Ullman

Publication date: 1968

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

zbMATH Keywords

languages, automata, networks

Related Items (6)

Superdeterministic DPDAs: The method of accepting does affect decision problems ⋮ Tree-walking-storage automata ⋮ 1-way stack automaton with jumps ⋮ On store languages of language acceptors ⋮ Stack languages and log n space ⋮ Checking automata and one-way stack languages

Cites Work

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

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