Multitape finite automata with rewind instructions

DOI10.1016/S0022-0000(67)80021-7MaRDI QIDQ2555470zbMATH OpenFDO

Authors Arnold L. Rosenberg

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)80021-7

Mathematics Subject Classification ID

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

Cites work

• A machine realization of the linear context-free languages
• scientific article; zbMATH DE number 3174044 (Why is no real title available?)
• scientific article; zbMATH DE number 7354705 (Why is no real title available?)
• On Relations Defined by Generalized Finite Automata
• On the Class of Predicates Decidable by Two-Way Multitape Finite Automata

Cited in

(2)

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

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

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