Abstract
Given an n-tape nondeterministic finite automaton (NFA) M with a one-way read-only head per tape and a right end marker $ on each tape, and a nonnegative integer k, we say that M is weakly k-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, no pair of input heads, neither of which is on $, are more than k cells apart. 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. We show decidable and undecidable results concerning questions such as: (1) Given M, is it weakly k-synchronized for some k (resp., for a specified k) and (2) Given M, is there a weakly k-synchronized M ′ for some k (resp., for a specified k) such that L(M ′) = L(M)? Most of our results are the strongest possible in the sense that slight restrictions on the models make the undecidable problems decidable. A few questions remain open.
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
Ibarra, O.H.: Reversal-bounded multicounter machines and their decision problems. J. Assoc. Comput. Mach. 25, 116–133 (1978)
Ibarra, O.H., Tran, N.: On synchronized multitape and multihead automata. In: Proc. of the 13th Int. Workshop on Descriptional Complexity of Formal Systems (DCFS 2011), pp. 184–197 (2011)
Ginsburg, G., Spanier, E.: Bounded Algol-like languages. Trans. of the Amer. Math. Society 113, 333–368 (1964)
Parikh, R.J.: On context-free languages. J. Assoc. Comput. Mach. 13, 570–581 (1966)
Yu, F., Bultan, T., Cova, M., Ibarra, O.H.: Symbolic String Verification: An Automata-Based Approach. In: Havelund, K., Majumdar, R. (eds.) SPIN 2008. LNCS, vol. 5156, pp. 306–324. Springer, Heidelberg (2008)
Yu, F., Bultan, T., Ibarra, O.H.: Symbolic String Verification: Combining String Analysis and Size Analysis. In: Kowalewski, S., Philippou, A. (eds.) TACAS 2009. LNCS, vol. 5505, pp. 322–336. Springer, Heidelberg (2009)
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)
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
Eğecioğlu, Ö., Ibarra, O.H., Tran, N.Q. (2012). Multitape NFA: Weak Synchronization of the Input Heads. In: Bieliková, M., Friedrich, G., Gottlob, G., Katzenbeisser, S., Turán, G. (eds) SOFSEM 2012: Theory and Practice of Computer Science. SOFSEM 2012. Lecture Notes in Computer Science, vol 7147. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27660-6_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-27660-6_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-27659-0
Online ISBN: 978-3-642-27660-6
eBook Packages: Computer ScienceComputer Science (R0)