Abstract
We define two-dimensional rational automata for pictures as an extension of classical finite automata for strings. They are obtained replacing the finite relation computed by the transition function with a rational relation computed by a transducer. The model provides a uniform setting for the most important notions, techniques and results presented in the last decades for recognizable two-dimensional languages, and establishes new connections between one- and two- dimensional language theory.
Partially supported by 60 % Projects of University of Catania, Roma “Tor Vergata”, Salerno (2011).
This is a preview of subscription content, log in via an institution to check access.
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
Anselmo, M., Giammarresi, D., Madonia, M.: A computational model for recognizable two-dimensional languages. Theoret. Comput. Sci. 410(37), 3520–3529 (2009)
Anselmo, M., Giammarresi, D., Madonia, M.: Deterministic and unambiguous families within recognizable two-dimensional languages. Fund. Inform. 98(2-3), 143–166 (2010)
Anselmo, M., Madonia, M.: Deterministic and unambiguous two-dimensional languages over one-letter alphabet. Theor. Comput. Sci. 410(16), 1477–1485 (2009)
Berstel, J.: Transductions and Context-Free Languages. Teubner Studienbücher (1979)
Blum, M., Hewitt, C.: Automata on a 2-dimensional tape. In: FOCS, pp. 155–160. IEEE (1967)
Carayol, A., Meyer, A.: Context-sensitive languages, rational graphs and determinism. Logical Methods in Computer Science 2(2), 1–24 (2006)
Crespi Reghizzi, S., Giammarresi, D., Lonati, V.: Two dimensional models. In: Pin, J.E. (ed.) Automata from Mathematics to Application. Eur. Math. Soc. (to appear)
Culik II, K., Kari, J.: An Aperiodic Set of Wang Cubes. In: Puech, C., Reischuk, R. (eds.) STACS 1996. LNCS, vol. 1046, pp. 137–146. Springer, Heidelberg (1996)
De Prophetis, L., Varricchio, S.: Recognizability of rectangular pictures by Wang systems. Journal of Automata, Languages and Combinatorics 2(4), 269–288 (1997)
Dolzhenko, E., Jonoska, N.: On Complexity of Two Dimensional Languages Generated by Transducers. In: Ibarra, O.H., Ravikumar, B. (eds.) CIAA 2008. LNCS, vol. 5148, pp. 181–190. Springer, Heidelberg (2008)
Eilenberg, S.: Automata, Languages and Machines, vol. A. Academic Press, N.Y. (1974)
Elgot, C.C., Metzei, J.E.: On relations defined by generalized finite automata. IBM J. Res. Develop. 9, 47–68 (1965)
Giammarresi, D., Restivo, A.: Recognizable picture languages. Int. J. Pattern Recogn. Artif. Intell. 6(2-3), 241–256 (1992)
Giammarresi, D., Restivo, A.: Two-dimensional languages. In: Rozenberg, G., et al. (eds.) Handbook of Formal Languages, vol. 3, pp. 215–267. Springer (1997)
Giammarresi, D., Restivo, A., Seibert, S., Thomas, W.: Monadic second-order logic over rectangular pictures and recognizability by tiling systems. Inf. Comput. 125(1), 32–45 (1996)
Harju, T., Karhumäki, J.: Finite transducers and rational transduction. In: Pin, J.E. (ed.) Automata from Mathematics to Application. Eur. Math. Soc. (to appear)
Inoue, K., Nakamura, A.: Some properties of two-dimensional on-line tessellation acceptors. Information Sciences 13(2), 95–121 (1977)
Latteux, M., Simplot, D.: Recognizable picture languages and domino tiling. Theor. Comput. Sci. 178(1-2), 275–283 (1997)
Lonati, V., Pradella, M.: Strategies to scan picture with automata based on Wang tiles. RAIRO - Theor. Inf. and Appl. 45(1), 163–180 (2011)
Lonati, V., Pradella, M.: Deterministic recognizability of picture languages with Wang automata. Discr. Math. and Theoret. Comput. Sci. 4, 73–94 (2010)
Matz, O.: On Piecewise Testable, Starfree, and Recognizable Picture Languages. In: Nivat, M. (ed.) FoSSaCS 1998. LNCS, vol. 1378, pp. 203–210. Springer, Heidelberg (1998)
Medvedev, Y.T.: On the class of events representable in a finite automaton. In: Moore, E.F. (ed.) Sequential Machines - Selected Papers (translated from Russian), pp. 215–227. Addison-Wesley, New York (1964)
Sakarovitch, J.: Elements of Automata Theory. Cambridge University Press (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Anselmo, M., Giammarresi, D., Madonia, M. (2013). Two-Dimensional Rational Automata: A Bridge Unifying One- and Two-Dimensional Language Theory. In: van Emde Boas, P., Groen, F.C.A., Italiano, G.F., Nawrocki, J., Sack, H. (eds) SOFSEM 2013: Theory and Practice of Computer Science. SOFSEM 2013. Lecture Notes in Computer Science, vol 7741. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35843-2_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-35843-2_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-35842-5
Online ISBN: 978-3-642-35843-2
eBook Packages: Computer ScienceComputer Science (R0)