The Equivalence Problem of Deterministic Multitape Finite Automata: A New Proof of Solvability Using a Multidimensional Tape

DOI10.1007/978-3-642-13089-2_33MaRDI QIDQ3564880zbMATH OpenOpenAlexFDO

Authors A. S. Shoukourian, Samvel K. Shoukourian, A. A. Letichevskij

Publication date 26 May 2010

Published in Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-13089-2_33

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• The equivalence problem of multidimensional multitape automata
• The equivalence problem of multitape finite automata
• On the equivalence problem for deterministic multitape automata and transducers
• Revisiting the equivalence problem for finite multitape automata
• A class of multitape automata with a decidable equivalence problem
• scientific article; zbMATH DE number 4037263
• Algorithm for establishing the equivalence of deterministic multitape automata
• Implementation and Application of Automata
• Equivalence of two-dimensional multitape automata
• The problem of equivalent transformations for homogeneous multitape automata

Cited in

(4)

• A new approach to solving equivalence problem
• Polynomial algorithm for equivalence problem of deterministic multitape finite automata
• Algorithm for establishing the equivalence of deterministic multitape automata
• The equivalence problem of multidimensional multitape automata

This page was built for publication: The Equivalence Problem of Deterministic Multitape Finite Automata: A New Proof of Solvability Using a Multidimensional Tape

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