A class of universal linear bounded automata

DOI10.1016/0020-0255(73)90036-4MaRDI QIDQ2563150zbMATH OpenOpenAlexFDO

Authors 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

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Formal languages and automata (68Q45)

Cites work

• Classes of languages and linear-bounded automata
• scientific article; zbMATH DE number 3310089 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)

Cited in

(4)

• Techniques for separating space complexity classes
• Relating refined space complexity classes
• Context-free languages can be accepted with absolutely no space overhead
• Shape recognition by a finite automaton robot

This page was built for publication: A class of universal linear bounded automata

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