On Synchronized Multitape and Multihead Automata
From MaRDI portal
Publication:5200091
DOI10.1007/978-3-642-22600-7_15zbMath1341.68094OpenAlexW29362136MaRDI QIDQ5200091
Nicholas Q. Tran, Oscar H. Ibarra
Publication date: 29 July 2011
Published in: Descriptional Complexity of Formal Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-22600-7_15
Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Related Items (2)
Multitape NFA: Weak Synchronization of the Input Heads ⋮ On the Boundedness Property of Semilinear Sets
Cites Work
- Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
- The equivalence problem of multitape finite automata
- A note on semilinear sets and bounded-reversal multihead pushdown automata
- Relational String Verification Using Multi-track Automata
- Symbolic String Verification: Combining String Analysis and Size Analysis
- Reversal-Bounded Multicounter Machines and Their Decision Problems
- New Decidability Results Concerning Two-Way Counter Machines
This page was built for publication: On Synchronized Multitape and Multihead Automata