Skip to main content
SpringerLink
Log in

Picture Codes with Finite Deciphering Delay

  • Conference paper
Book cover Language and Automata Theory and Applications (LATA 2014)

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

  • 1061 Accesses

Abstract

A two-dimensional code is defined as a set X ⊆ Σ** such that any picture over Σ is tilable in at most one way with pictures in X. The codicity problem is in general undecidable. Very recently in [4] prefix picture codes were introduced as a decidable subclass that generalizes prefix string codes. Finite deciphering delay sets are an interesting class of string codes that coincide with prefix codes in the case of delay equal to 0. An analogous notion is introduced for picture codes and it is proved that they correspond to a bigger class of decidable picture codes that includes interesting examples and special cases.

Partially supported by MIUR Projects “Aspetti matematici e applicazioni emergenti degli automi e dei linguaggi formali” and “PRISMA PON04a2 A/F”, by 60 % Projects of University of Catania, Roma “Tor Vergata”, Salerno.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aigrain, P., Beauquier, D.: Polyomino tilings, cellular automata and codicity. Theoretical Computer Science 147, 165–180 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  2. Anselmo, M., Giammarresi, D., Madonia, M.: Deterministic and unambiguous families within recognizable two-dimensional languages. Fund. Inform 98(2-3), 143–166 (2010)

    MATH  MathSciNet  Google Scholar 

  3. Anselmo, M., Giammarresi, D., Madonia, M.: Strong prefix codes of pictures. In: Muntean, T., Poulakis, D., Rolland, R. (eds.) CAI 2013. LNCS, vol. 8080, pp. 47–59. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  4. Anselmo, M., Giammarresi, D., Madonia, M.: Two-dimensional codes of pictures. In: Béal, M.-P., Carton, O. (eds.) DLT 2013. LNCS, vol. 7907, pp. 46–57. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  5. Anselmo, M., Giammarresi, D., Madonia, M., Restivo, A.: Unambiguous recognizable two-dimensional languages. RAIRO: Theoretical Informatics and Applications 40(2), 227–294 (2006)

    MathSciNet  Google Scholar 

  6. 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 

  7. Beauquier, D., Nivat, M.: A codicity undecidable problem in the plane. Theoret. Comp. Sci. 303, 417–430 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  8. Berstel, J., Perrin, D., Reutenauer, C.: Codes and Automata. Cambridge University Press (2009)

    Google Scholar 

  9. Bozapalidis, S., Grammatikopoulou, A.: Picture codes. ITA 40(4), 537–550 (2006)

    MATH  MathSciNet  Google Scholar 

  10. Bruyère, V., Wang, L., Zhang, L.: On completion of codes with finite deciphering delay. Europ. J. Combinatorics 11, 513–521 (1990)

    Article  MATH  Google Scholar 

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

    Article  Google Scholar 

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

    Google Scholar 

  13. Grammatikopoulou, A.: Prefix picture sets and picture codes. In: Procs. CAI 2005, pp. 255–268. Aristotle University of Thessaloniki (2005)

    Google Scholar 

  14. Kolarz, M., Moczurad, W.: Multiset, Set and Numerically Decipherable Codes over Directed Figures. In: Smyth, B. (ed.) IWOCA 2012. LNCS, vol. 7643, pp. 224–235. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  15. 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 

  16. Moczurad, M., Moczurad, W.: Some open problems in decidability of brick (Labelled polyomino) codes. In: Chwa, K.-Y., Munro, J.I. (eds.) COCOON 2004. LNCS, vol. 3106, pp. 72–81. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  17. Simplot, D.: A characterization of recognizable picture languages by tilings by finite sets. Theoretical Computer Science 218(2), 297–323 (1991)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica, Università di Salerno, via Giovanni Paolo II, 132-84084, Fisciano, SA, Italy

    Marcella Anselmo

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

    Dora Giammarresi

  3. Dipartimento di Matematica e Informatica, Università di Catania, Viale Andrea Doria 6/a, 95125, Catania, Italy

    Maria Madonia

Authors
  1. Marcella Anselmo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dora Giammarresi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Maria Madonia
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Research Group on Mathematical Linguistics, Rovira i Virgili University, Avinguda Catalunya, 35, 43002, Tarragona, Spain

    Adrian-Horia Dediu  & Carlos Martín-Vide  & 

  2. School of Computer Science, Department of Software Engineering and Artificial Intelligence, Complutense University of Madrid, Professor José Garcia Santesmases, 9, 28040, Madrid, Spain

    José-Luis Sierra-Rodríguez

  3. Fakultät für Informatik, Institut für Wissens- und Sprachverarbeitung, Otto-von-Guericke-Universität Magdeburg, Universitätsplatz 2, 39106, Magdeburg, Germany

    Bianca Truthe

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Anselmo, M., Giammarresi, D., Madonia, M. (2014). Picture Codes with Finite Deciphering Delay. In: Dediu, AH., Martín-Vide, C., Sierra-Rodríguez, JL., Truthe, B. (eds) Language and Automata Theory and Applications. LATA 2014. Lecture Notes in Computer Science, vol 8370. Springer, Cham. https://doi.org/10.1007/978-3-319-04921-2_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-04921-2_7

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-04920-5

  • Online ISBN: 978-3-319-04921-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation