On synchronized multi-tape and multi-head automata
From MaRDI portal
Publication:443740
DOI10.1016/J.TCS.2012.04.006zbMATH Open1253.68204OpenAlexW2021721427MaRDI QIDQ443740FDOQ443740
Authors: Oscar H. Ibarra, Nicholas Q. Tran 
Publication date: 13 August 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.04.006
Recommendations
Cites Work
- Reversal-Bounded Multicounter Machines and Their Decision Problems
- Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
- New Decidability Results Concerning Two-Way Counter 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
Cited In (8)
- On the open problem of Ginsburg concerning semilinear sets and related problems
- Multitape NFA: Weak Synchronization of the Input Heads
- Weak synchronization and synchronizability of multitape pushdown automata and Turing machines
- How to synchronize the heads of a multitape automaton
- On Synchronized Multitape and Multihead Automata
- Title not available (Why is that?)
- On deciding synchronizability for asynchronously communicating systems
- How to synchronize the heads of a multitape automaton
This page was built for publication: On synchronized multi-tape and multi-head automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q443740)
