Skip to main content
SpringerLink
Log in
Book cover

International Conference on Developments in Language Theory

DLT 2010: Developments in Language Theory pp 4–15Cite as

A Brief Excursion Inside the Class of Tiling Recognizable Two-Dimensional Languages

  • Conference paper

  • 586 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6224))

Abstract

Tiling recognizable two-dimensional languages, also known as REC, generalize recognizable string languages to two dimensions and share with them several theoretical properties. Nevertheless REC is not closed under complementation and this implies that it is intrinsically non-deterministic. As result, all subclasses corresponding to different notion of unambiguity and determinism define a hierarchy inside REC. Moreover we show that some definitions of unambiguity are equivalent to corresponding notions of determinism and therefore correspond decidable classes closed under complementation and linear parsing algorithms.

This work was partially supported by MIUR Project ”Aspetti matematici e applicazioni emergenti degli automi e dei linguaggi formali” (2007), by ESF Project “AutoMathA” (2005-2010).

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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)

    Chapter  Google Scholar 

  2. Anselmo, M., Giammarresi, D., Madonia, M.: A computational model for tiling recognizable two-dimensional languages. Theoretical Computer Science 410(37), 3520–3529 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  3. Anselmo, M., Giammarresi, D., Madonia, M., Restivo, A.: Unambiguous Recognizable Two-dimensional Languages. RAIRO: Theoretical Informatics and Applications 40(2), 227–294 (2006)

    Article  MathSciNet  Google Scholar 

  4. Anselmo, M., Madonia, M.: Deterministic and unambiguous two-dimensional languages over one-letter alphabet. Theoretical Computer Science 410(16), 1477–1485 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  5. Blum, M., Hewitt, C.: Automata on a two-dimensional tape. In: IEEE Symposium on Switching and Automata Theory, pp. 155–160 (1967)

    Google Scholar 

  6. Bozapalidis, S., Grammatikopoulou, A.: Recognizable picture series. Journal of Automata, Languages and Combinatorics, Special vol. on Weighted Automata (2004)

    Google Scholar 

  7. Crespi Reghizzi, S., Pradella, M.: Tile rewriting grammars and picture languages. Theoretical Computer Science 340(2), 257–272 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  8. De Prophetis, L., Varricchio, S.: Recognizability of rectangular pictures by wang systems. Journal of Automata, Languages, Combinatorics 2, 269–288 (1997)

    MATH  Google Scholar 

  9. Eilenberg, S.: Automata, Languages and Machines, vol. A. Academic Press, London (1974)

    MATH  Google Scholar 

  10. Giammarresi, D., Restivo, A.: Recognizable picture languages. Int. Journal Pattern Recognition and Artificial Intelligence 6(2,3), 241–256 (1992)

    Article  Google Scholar 

  11. Giammarresi, D., Restivo, A.: Two-dimensional languages. In: Rozenberg, G., et al. (eds.) Handbook of Formal Languages, vol. III, pp. 215–268. Springer, Heidelberg (1997)

    Google Scholar 

  12. Giammarresi, D., Restivo, A.: Matrix-based complexity functions and recognizable picture languages. In: Grader, E., Flum, J., Wilke, T. (eds.) Logic and Automata: History and Perspectives. Texts in Logic and Games, vol. 2, pp. 315–337. Amsterdam University Press (2007)

    Google Scholar 

  13. Giammarresi, D., Restivo, A., Seibert, S., Thomas, W.: Monadic second order logic over pictures and recognizability by tiling systems. Information and Computation 125(1), 32–45 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  14. Inoue, K., Nakamura, A.: Some properties of two-dimensional on-line tessellation acceptors. Information Sciences 13, 95–121 (1977)

    Article  MathSciNet  Google Scholar 

  15. Inoue, K., Takanami, I.: A characterization of recognizable picture languages. In: Nakamura, A., Saoudi, A., Inoue, K., Wang, P.S.P., Nivat, M. (eds.) ICPIA 1992. LNCS, vol. 654. Springer, Heidelberg (1992)

    Google Scholar 

  16. Latteux, M., Simplot, D.: Recognizable Picture Languages and Domino Tiling. Theorethical Computer Science 178(1-2), 275–283 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  17. Lindgren, K., Moore, C., Nordahl, M.: Complexity of two-dimensional patterns. Journal of Statistical Physics 91(5-6), 909–951 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  18. Matz, O.: Regular expressions and Context-free Grammars for picture languages. In: Reischuk, R., Morvan, M. (eds.) STACS 1997. LNCS, vol. 1200, pp. 283–294. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  19. Lonati, V., Pradella, M.: Snake-Deterministic Tiling Systems. In: Královič, R., Niwiński, D. (eds.) MFCS 2009. LNCS, vol. 5734, pp. 549–560. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  20. Lonati, V., Pradella, M.: Picture-recognizability with automata based on wang tiles. In: van Leeuwen, J. (ed.) SOFSEM 2010. LNCS, vol. 5901, pp. 576–587. Springer, Heidelberg (2010)

    Google Scholar 

  21. Matz, O.: On piecewise testable, starfree, and recognizable picture languages. In: Nivat, M. (ed.) FOSSACS 1998. LNCS, vol. 1378, p. 203. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  22. Potthoff, A., Seibert, S., Thomas, W.: Nondeterminism versus determinism of finite automata over directed acyclic graphs. Bull. Belgian Math. Soc. 1, 285–298 (1994)

    MATH  MathSciNet  Google Scholar 

  23. Siromoney, R.: Advances in array languages. In: Ehrig, H., Nagl, M., Rosenfeld, A., Rozenberg, G. (eds.) Graph Grammars 1986. LNCS, vol. 291, pp. 549–563. Springer, Heidelberg (1987)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Matematica, Università di Roma “Tor Vergata”, via della Ricerca Scientifica, 00133, Roma, Italy

    Dora Giammarresi

Authors
  1. Dora Giammarresi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Computer Science, University of Western Ontario, N6A 5B7, London, ON, Canada

    Yuan Gao , Hanlin Lu , Shinnosuke Seki  & Sheng Yu , ,  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Giammarresi, D. (2010). A Brief Excursion Inside the Class of Tiling Recognizable Two-Dimensional Languages. In: Gao, Y., Lu, H., Seki, S., Yu, S. (eds) Developments in Language Theory. DLT 2010. Lecture Notes in Computer Science, vol 6224. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14455-4_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-14455-4_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-14454-7

  • Online ISBN: 978-3-642-14455-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation