Sets accepted by one-way stack automata are context sensitive

DOI10.1016/S0019-9958(68)90722-5MaRDI QIDQ5585423zbMATH OpenOpenAlexFDO

Authors John Hopcroft, Jeffrey D. Ullman

Publication date 1968

Published in Information and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0019-9958(68)90722-5

zbMATH Keywords

languages, automata, networks

Cited in

(15)

• Stack languages and log n space
• Space complexity of stack automata models
• Closures which preserve finiteness in families of languages
• Theory of formal grammars
• The theory of languages
• The theory of languages
• Deterministic stack transducers
• Tree-walking-storage automata
• Deterministic tree-walking-storage automata
• Deterministic stack transducers
• Rudimentary relations and stack languages
• Space Complexity of Stack Automata Models
• Reachability analysis of pushdown systems with an upper stack
• Unilateral context sensitive grammars and left-to-right parsing
• A note on self-modifying finite automata

This page was built for publication: Sets accepted by one-way stack automata are context sensitive

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