Sets accepted by one-way stack automata are context sensitive

DOI10.1016/S0019-9958(68)90722-5zbMath0191.31005OpenAlexW2021158845MaRDI QIDQ5585423

John E. Hopcrofts, 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

Related Items

The theory of languages, Space Complexity of Stack Automata Models, The theory of languages, Deterministic Stack Transducers, Tree-walking-storage automata, Reachability Analysis of Pushdown Systems with an Upper Stack, Rudimentary relations and stack languages, Stack languages and log n space, Closures which preserve finiteness in families of languages, Deterministic Stack Transducers, Unilateral context sensitive grammars and left-to-right parsing, A note on self-modifying finite automata, Theory of formal grammars, Space Complexity of Stack Automata Models