A class of universal linear bounded automata
From MaRDI portal
Publication:2563150
DOI10.1016/0020-0255(73)90036-4zbMath0268.94043OpenAlexW1968350065MaRDI QIDQ2563150
Eliot D. Feldman, James C. jun. Owings
Publication date: 1973
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0255(73)90036-4
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)
Related Items (4)
Shape recognition by a finite automaton robot ⋮ Techniques for separating space complexity classes ⋮ Relating refined space complexity classes ⋮ Context-free languages can be accepted with absolutely no space overhead
Cites Work
This page was built for publication: A class of universal linear bounded automata
