The Equivalence Problem of Deterministic Multitape Finite Automata: A New Proof of Solvability Using a Multidimensional Tape
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.
Unable to display preview. Download preview PDF.
- 1.Bird, M.: The equivalence problem for deterministic two-tape automata (1973)Google Scholar
- 2.Clifford, A.H., Preston, G.B.: The algebraic theory of semigroups (1961)Google Scholar
- 3.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)Google Scholar
- 4.Grigorian, H.A., Shoukourian, S.K.: The equivalence problem of multidimensional multitape automata (2008)Google Scholar
- 5.Harju, T., Karhumäki, J.: The equivalence problem of multitape finite automata (1991)Google Scholar
- 6.Rabin, M.O., Scott, D.: Finite automata and their decision problems (1959)Google Scholar
- 7.Shoukourian, A.S.: Equivalence of regular expressions over a partially commutative alphabet (2009)Google Scholar