The equivalence problem of multidimensional multitape automata
From MaRDI portal
Publication:955343
DOI10.1016/J.JCSS.2008.02.006zbMath1152.68029OpenAlexW2054358341MaRDI QIDQ955343
Haik Grigorian, Samvel K. Shoukourian
Publication date: 19 November 2008
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2008.02.006
Related Items (2)
Another approach to the equivalence of measure-many one-way quantum finite automata and its application ⋮ Equivalence of regular expressions over a partially commutative alphabet
Cites Work
- Unnamed Item
- The equivalence problem of multitape finite automata
- Equivalence of two-dimensional multitape automata
- On formalised computer programs
- Reducibility of program-scheme functional equivalence on a nondegenerate basis of rank unity to the equivalence of automata with multidimensional tapes
- Functional equivalence of discrete processors. II
This page was built for publication: The equivalence problem of multidimensional multitape automata