Abstract
In this paper we study a class of factor-closed tiling recognizable languages (FREC) that corresponds to certain symbolic dynamical systems called sofic subshifts. This class of languages is a subclass of the two-dimensional class of tiling recognizable languages, denoted REC. Differently from REC, languages in FREC can be recognized without framing pictures with a special boundary symbol. We study (un)ambiguity properties of FREC in comparison to the ones in REC. We show that a frame surrounding each block provides additional memory that can enforce the size and the content of pictures and can change (un)ambiguity properties. Consequently, we propose several variations of “unambiguity” for languages in FREC which may be better suited to understand this class.
N.J. is partially supported by the NSF grants CCF #0523928 and CCF #0726396. M.A. and M.M. by MIUR Project “Automi e Linguaggi Formali: aspetti matematici e applicativi” (2005), by ESF Project AutoMathA” (2005-2010), by 60 % Projects of University of Catania and Salerno (2006, 2007).
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 subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Anselmo, M., Madonia, M.: Deterministic two-dimensional languages over one-letter alphabet. In: Bozapalidis, S., Rahonis, G. (eds.) CAI 2007. LNCS, vol. 4728, pp. 147–159. Springer, Heidelberg (2007)
Anselmo, M., Madonia, M.: Deterministic and unambiguous two-dimensional languages over one-letter alphabet. In: TCS (to appear, 2008)
Anselmo, M., Giammarresi, D., Madonia, M.: From determinism to non-determinism in recognizable two-dimensional languages. In: Harju, T., Karhumäki, J., Lepistö, A. (eds.) DLT 2007. LNCS, vol. 4588, pp. 36–47. Springer, Heidelberg (2007)
Anselmo, M., Giammarresi, D., Madonia, M., Restivo, A.: Unambiguous Recognizable two-dimensional languages. RAIRO: Theoretical Informatics and Applications 2, 227–294 (2006)
Béal, M.P., Perrin, D.: Symbolic Dynamics and Finite Automata. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, ch. 10, vol. 2. Springer, Heidelberg (1997)
Berger, R.: The undecidability of the Domino Problem, Memoirs AMS n. 66 (1966)
Chrobak, M., Rytter, W.: Unique decipherability for partially commutative alphabets. In: Fundamenta Informaticae, vol. X, pp. 323–336. North-Holland, Amsterdam (1987)
Coven, E., Johnson, A., Jonoska, N., Madden, K.: The Symbolic Dynamics of Multidimensional Tiling Systems. Ergodic Theory and Dynamical Systems 23, 447–460 (2003)
Eilenberg, S.: Automata, Languages and Machines, vol. A. Academic Press, London (1974)
Fichtner, I.: Characterizations of Recognizable Picture Series. Ph.D Thesis Universität Leipzig, Institut für Informatik, Abteilung Automaten und Sprachen (2007), http://www.informatik.uni-leipzig.de/~maeurer/diss.pdf
Giammarresi, D., Restivo, A.: Recognizable picture languages. In: Nivat, M., Saoudi, A., Wang, P.S.P. (eds.) Proc. 1st Internat. Colloq. on Parallel Image Processing; Internat. J. Pattern Recognition Artif. Intell. 6, 231–256 (1992)
Giammarresi, D., Restivo, A.: Two-dimensional languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. III, pp. 215–268. Springer, Berlin (1997)
Jonoska, N., Pirnot, J.B.: Transitivity in two-dimensional local languages defined by dot systems. International Journal of Foundations of Computer Science 17(2), 435–464 (2006)
Kari, J.: A small aperiodic set of Wang tiles. Discrete Mathematics 160(1-3), 259–264 (1996)
Kitchens, B., Schmidt, K.: Markov subgroups of \(({\mathbb Z/2} {\mathbb Z})^{\mathbb Z^2}\). In: Walters, P. (ed.) Symbolic Dynamics and its Applications. Contemporary Mathematics, vol. 135, pp. 265–283 (1992)
Kitchens, B., Schmidt, K.: Automorphisms of compact groups. Ergod. Th. & Dynam. Sys. 9, 691–735 (1989)
Kitchens, B.: Symbolic Dynamics. Springer, New York (1998)
Lind, D., Marcus, B.: An Introduction to Symbolic Dynamics and Coding. Cambridge University Press, Cambridge (1995)
Madden, K., Johnson, A.: Factoring Higher Dimensional Shifts of Finite Type onto the Full Shift. Ergodic Theory and Dynamical Systems 25, 811–822 (2005)
Meester, R., Steif, J.E.: Higher-dimensional subshifts of finite type, factor maps and measures of maximal entropy. Pacific J. Math. 200(2), 497–510 (2001)
Quas, A., Trow, P.: Subshifts of multi-dimensional shifts of finite type. Ergodic Theory Dynam. Systems 20, 859–874 (2000)
Robinson, R.: Undecidability and Nonperiodicity of Tilings of the Plane. Inventiones Math. 12, 177–209 (1971)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Anselmo, M., Jonoska, N., Madonia, M. (2009). Framed Versus Unframed Two-Dimensional Languages. In: Nielsen, M., Kučera, A., Miltersen, P.B., Palamidessi, C., Tůma, P., Valencia, F. (eds) SOFSEM 2009: Theory and Practice of Computer Science. SOFSEM 2009. Lecture Notes in Computer Science, vol 5404. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-95891-8_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-95891-8_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-95890-1
Online ISBN: 978-3-540-95891-8
eBook Packages: Computer ScienceComputer Science (R0)