Abstract
This publication presents a new proof of solvability for the equivalence problem of deterministic multitape finite automata, based on modeling their behavior via a multidimensional tape. It is shown that for a decision on equivalence of two automata it is necessary and sufficient to consider finite sets of their execution trace words built over the mentioned multidimensional tape.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bird, M.: The equivalence problem for deterministic two-tape automata (1973)
Clifford, A.H., Preston, G.B.: The algebraic theory of semigroups (1961)
Godlevskii, A.B., Letichevskii, A.A., Shukuryan, S.K.: Reducibility of program-scheme functional equivalence on a nondegenerate basis of rank unity to the equivalence of automata with multidimensional tapes (1980)
Grigorian, H.A., Shoukourian, S.K.: The equivalence problem of multidimensional multitape automata (2008)
Harju, T., Karhumäki, J.: The equivalence problem of multitape finite automata (1991)
Rabin, M.O., Scott, D.: Finite automata and their decision problems (1959)
Shoukourian, A.S.: Equivalence of regular expressions over a partially commutative alphabet (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Letichevsky, A.A., Shoukourian, A.S., Shoukourian, S.K. (2010). The Equivalence Problem of Deterministic Multitape Finite Automata: A New Proof of Solvability Using a Multidimensional Tape. In: Dediu, AH., Fernau, H., Martín-Vide, C. (eds) Language and Automata Theory and Applications. LATA 2010. Lecture Notes in Computer Science, vol 6031. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13089-2_33
Download citation
DOI: https://doi.org/10.1007/978-3-642-13089-2_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13088-5
Online ISBN: 978-3-642-13089-2
eBook Packages: Computer ScienceComputer Science (R0)