Abstract
Given an n-tape automaton M with a one-way read-only head per tape and a right end marker $ on each tape, we say that M is aligned or 0-synchronized (or simply, synchronized) if for every n-tuple x = (x 1, …, x n ) that is accepted, there is a computation on x such that at any time during the computation, all heads, except those that have reached the end marker, are on the same position. When a head reaches the marker, it can no longer move. As usual, an n-tuple x = (x 1, …, x n ) is accepted if M eventually reaches the configuration where all n heads are on $ in an accepting state. In two recent papers, we looked at the problem of deciding, given an n-tape automaton of a given type, whether there exists an equivalent synchronized n-tape automaton of the same type. In this paper, we exhibit various classes of multitape automata which can(not) be converted to equivalent synchronized multitape automata.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baker, B.S., Book, R.V.: Reversal-bounded multipushdown machines. J. Computer and System Sciences 8, 315–332 (1974)
Eğecioğlu, Ö., Ibarra, O.H., Tran, N.Q.: Multitape NFA: Weak Synchronization of the Input Heads. In: Bieliková, M., Friedrich, G., Gottlob, G., Katzenbeisser, S., Turán, G. (eds.) SOFSEM 2012. LNCS, vol. 7147, pp. 238–250. Springer, Heidelberg (2012)
Ginsburg, G., Spanier, E.: Bounded Algol-like languages. Trans. of the Amer. Math. Society 113, 333–368 (1964)
Ibarra, O.H.: Reversal-bounded multicounter machines and their decision problems. J. Assoc. Comput. Math. 25, 116–133 (1978)
Ibarra, O.H., Seki, S.: Characterizations of bounded semilinear languages by one-way and two-way deterministic machines. In: Proc. 13th Int. Conf. on Automata and Formal Languages, AFL 2011 (2011)
Ibarra, O.H., Tran, N.Q.: Weak Synchronization and Synchronizability of Multitape Pushdown Automata and Turing Machines. In: Dediu, A.-H., Martín-Vide, C. (eds.) LATA 2012. LNCS, vol. 7183, pp. 337–350. Springer, Heidelberg (2012)
Minsky, M.: Recursive unsolvability of Post’s problem of Tag and other topics in the theory of Turing machines. Ann. of Math. (74), 437–455 (1961)
Parikh, R.J.: On context-free languages. J. Assoc. Comput. Mach. 13, 570–581 (1966)
Yu, F., Bultan, T., Ibarra, O.H.: Relational String Verification Using Multi-track Automata. In: Domaratzki, M., Salomaa, K. (eds.) CIAA 2010. LNCS, vol. 6482, pp. 290–299. Springer, Heidelberg (2011); Extended version in International J. Found. of Comput. Sci. 22, 1909–1924 (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ibarra, O.H., Tran, N.Q. (2012). How to Synchronize the Heads of a Multitape Automaton. In: Moreira, N., Reis, R. (eds) Implementation and Application of Automata. CIAA 2012. Lecture Notes in Computer Science, vol 7381. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31606-7_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-31606-7_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31605-0
Online ISBN: 978-3-642-31606-7
eBook Packages: Computer ScienceComputer Science (R0)