Nonerasing stack automata
From MaRDI portal
Publication:2530209
DOI10.1016/S0022-0000(67)80013-8zbMath0166.00506OpenAlexW2004701601WikidataQ56059676 ScholiaQ56059676MaRDI QIDQ2530209
Jeffrey D. Ullman, John E. Hopcrofts
Publication date: 1967
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(67)80013-8
Related Items
Alternating and empty alternating auxiliary stack automata., The theory of languages, Two-way automata with more than one storage medium, The theory of languages, Images of AFL under certain families of homomorphisms, Tree-walking-storage automata, Jede mit Stackautomaten berechenbare Funktion ist elementar, Symmetric space-bounded computation, Iterated stack automata and complexity classes, Relativization of questions about log space computability, On the complexity of finite, pushdown, and stack automata, Two-way nested stack automata are equivalent to two-way stack automata, Relating refined space complexity classes, Soft constraint automata with memory, Deterministic stack automata and the quotient operator, On the existence of generators for certain AFL, Tape-bounded Turing acceptors and principal AFLs, Characterizations of some tape and time complexity classes of Turing machines in terms of multihead and auxiliary stack automata, Tape-reversal bounded Turing machine computations, (Semi)alternating stack automata
Cites Work
