Abstract
In this article we consider two-way two-tape (alternating) automata accepting pairs of words and we study some closure properties of this model. Our main result is that such alternating automata are not closed under complementation for non-unary alphabets. This improves a similar result of Kari and Moore for picture languages. We also show that these deterministic, non-deterministic and alternating automata are not closed under composition.
Funded by the DeLTA project (ANR-16-CE40-0007).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Blum, M., Hewitt, C.: Automata on a 2-dimensional tape. In: 8th Annual Symposium on Switching and Automata Theory (SWAT 1967), pp. 155–160. IEEE (1967)
Cohen, A., Collard, J.F.: Instance-wise reaching definition analysis for recursive programs using context-free transductions. In: International Conference on Parallel Architectures and Compilation Techniques, pp. 332–339. IEEE (1998)
Elgot, C.C., Mezei, J.E.: On relations defined by generalized finite automata. IBM J. Res. Dev. 9, 47–68 (1965)
Engelfriet, J., Hoogeboom, H.J.: MSO definable string transductions and two-way finite-state transducers. ACM Trans. Comput. Log. 2(2), 216–254 (2001)
Giammarresi, D., Restivo, A.: Recognizable picture languages. Int. J. Pattern Recogn. Artif. Intell. 6, 241–256 (1992)
Grädel, E., Thomas, W., Wilke, T. (eds.): Automata, Logics, and Infinite Games: A Guide to Current Research. LNCS, vol. 2500. Springer, Heidelberg (2002)
Kapoutsis, C.: Removing bidirectionality from nondeterministic finite automata. In: Jȩdrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol. 3618, pp. 544–555. Springer, Heidelberg (2005). doi:10.1007/11549345_47
Kari, J., Moore, C.: New results on alternating and non-deterministic two-dimensional finite-state automata. In: Ferreira, A., Reichel, H. (eds.) STACS 2001. LNCS, vol. 2010, pp. 396–406. Springer, Heidelberg (2001). doi:10.1007/3-540-44693-1_35
Kari, J., Moore, C.: Rectangles and squares recognized by two-dimensional automata. In: Karhumäki, J., Maurer, H., Păun, G., Rozenberg, G. (eds.) Theory Is Forever. LNCS, vol. 3113, pp. 134–144. Springer, Heidelberg (2004). doi:10.1007/978-3-540-27812-2_13
Kari, J., Salo, V.: A survey on picture-walking automata. In: Kuich, W., Rahonis, G. (eds.) Algebraic Foundations in Computer Science. LNCS, vol. 7020, pp. 183–213. Springer, Heidelberg (2011). doi:10.1007/978-3-642-24897-9_9
Lind, D., Marcus, B.: An Introduction to Symbolic Dynamics and Coding. Cambridge University Press, Cambridge (1995)
Lothaire, M.: Algebraic Combinatorics on Words, Chap. 7, pp. 230–268. Cambridge University Press, Cambridge (2002)
Roche, E., Schabes, Y.: Finite-State Language Processing, Chap. 7. MIT Press, Cambridge (1997)
Sakarovitch, J.: Elements of Automata Theory. Cambridge University Press, Cambridge (2009)
Sipser, M.: Halting space-bounded computations. Theor. Comput. Sci. 10(3), 335–338 (1980)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Carton, O., Exibard, L., Serre, O. (2017). Two-Way Two-Tape Automata. In: Charlier, É., Leroy, J., Rigo, M. (eds) Developments in Language Theory. DLT 2017. Lecture Notes in Computer Science(), vol 10396. Springer, Cham. https://doi.org/10.1007/978-3-319-62809-7_10
Download citation
DOI: https://doi.org/10.1007/978-3-319-62809-7_10
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-62808-0
Online ISBN: 978-3-319-62809-7
eBook Packages: Computer ScienceComputer Science (R0)