Multitape finite automata with rewind instructions

DOI10.1016/S0022-0000(67)80021-7zbMath0245.94037MaRDI QIDQ2555470

Arnold L. Rosenberg

Publication date: 1967

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Related Items (2)

Degree-languages: A new concept of acceptance ⋮ Der programmierbare endliche Automat. (The programmable finite automaton)

Cites Work

• Unnamed Item
• Unnamed Item
• On Relations Defined by Generalized Finite Automata
• On the Class of Predicates Decidable by Two-Way Multitape Finite Automata
• A machine realization of the linear context-free languages

This page was built for publication: Multitape finite automata with rewind instructions