The equivalence problem of multitape finite automata
Theoretical Computer Science
Equivalence of two-dimensional multitape automata
Cybernetics and Systems Analysis
Finite automata and their decision problems
IBM Journal of Research and Development
On formalised computer programs
Journal of Computer and System Sciences
Equivalence of regular expressions over a partially commutative alphabet
Cybernetics and Systems Analysis
Journal of Computer and System Sciences
Hi-index | 0.00 |
This article considers the equivalence problem of multitape automata with multidimensional tapes, where the motion of the heads is monotone in all directions (no backward motion). It is shown that this problem can be reduced to the equivalence problem of ordinary multitape automata. Some applications of the result are adduced.