Formalization of the concept of multitape automaton

DOI10.1007/BF01070235MaRDI QIDQ3814815zbMATH OpenFDO

Authors P. V. Gorshkov, K. V. Arkhangel'Skij

Publication date 1987

Published in Cybernetics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01070235

zbMATH Keywords

multitape automatamultitape suffix languagesnondeterministic suffix languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Two-way two-tape automata
• Equivalence of two-dimensional multitape automata
• A class of multitape automata with a decidable equivalence problem
• Minimality and deadlockness of multitape automata
• Some results on regular expressions for multitape finite automata

Cites work

• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 3254905 (Why is no real title available?)
• The equivalence problem for deterministic two-tape automata

Cited in

(3)

• LABELLING MULTI-TAPE AUTOMATA WITH CONSTRAINED SYMBOL CLASSES
• Some results on regular expressions for multitape finite automata
• Multi-tape Automata with Symbol Classes

This page was built for publication: Formalization of the concept of multitape automaton

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