Skip to main content
SpringerLink
Log in

Toroidal Codes and Conjugate Pictures

  • Conference paper
  • First Online:
Book cover Language and Automata Theory and Applications (LATA 2019)

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

Abstract

Toroidal codes of pictures are introduced as the generalization of circular codes of strings in two dimensions. They are characterized by a property of very pureness on a generated language. The class of such codes is compared with other close classes of codes of pictures. In analogy to the string case, toroidal codes are investigated in relation to the conjugate pictures. Conjugacy between pictures is here defined and many properties and characterizations are shown.

Partially supported by INdAM-GNCS Project 2018, FARB Project ORSA175982 of University of Salerno and CREAMS Project of University of Catania.

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 EPUB and 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

References

  1. Aigrain, P., Beauquier, D.: Polyomino tilings, cellular automata and codicity. Theor. Comput. Sci. 147, 165–180 (1995)

    Article  MathSciNet  Google Scholar 

  2. 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). https://doi.org/10.1007/978-3-642-40663-8_6

    Chapter  Google Scholar 

  3. Anselmo, M., Giammarresi, D., Madonia, M.: Two dimensional prefix codes of pictures. In: Béal, M.-P., Carton, O. (eds.) DLT 2013. LNCS, vol. 7907, pp. 46–57. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-38771-5_6

    Chapter  MATH  Google Scholar 

  4. Anselmo, M., Giammarresi, D., Madonia, M.: Prefix picture codes: a decidable class of two-dimensional codes. Int. J. Found. Comput. Sci. 25(8), 1017–1032 (2014)

    Article  MathSciNet  Google Scholar 

  5. Anselmo, M., Giammarresi, D., Madonia, M.: Unbordered pictures: properties and construction. In: Maletti, A. (ed.) CAI 2015. LNCS, vol. 9270, pp. 45–57. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-23021-4_5

    Chapter  Google Scholar 

  6. Anselmo, M., Giammarresi, D., Madonia, M.: Avoiding overlaps in pictures. In: Pighizzini, G., Câmpeanu, C. (eds.) DCFS 2017. LNCS, vol. 10316, pp. 16–32. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-60252-3_2

    Chapter  MATH  Google Scholar 

  7. Anselmo, M., Giammarresi, D., Madonia, M.: Picture codes and deciphering delay. Inf. Comput. 253, 358–370 (2017)

    Article  MathSciNet  Google Scholar 

  8. Anselmo, M., Giammarresi, D., Madonia, M.: Structure and properties of strong prefix codes of pictures. Math. Struct. Comput. Sci. 27(2), 123–142 (2017)

    Article  MathSciNet  Google Scholar 

  9. Anselmo, M., Madonia, M.: Two-dimensional comma-free and cylindric codes. Theor. Comput. Sci. 658, 4–17 (2017)

    Article  MathSciNet  Google Scholar 

  10. Barton, C., Iliopoulos, C.S., Pissis, S.P.: Fast algorithms for approximate circular string matching. Algorithms Mol. Biol. 9, 9 (2014)

    Article  Google Scholar 

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

    Book  Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

  13. De Felice, C., Zaccagnino, R., Zizza, R.: Unavoidable sets and regularity of languages generated by (1, 3)-circular splicing systems. In: Dediu, A.-H., Lozano, M., Martín-Vide, C. (eds.) TPNC 2014. LNCS, vol. 8890, pp. 169–180. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-13749-0_15

    Chapter  Google Scholar 

  14. De Felice, C., Zaccagnino, R., Zizza, R.: Unavoidable sets and circular splicing languages. Theor. Comput. Sci. 658, 148–158 (2017)

    Article  MathSciNet  Google Scholar 

  15. Gamard, G., Richomme, G., Shallit, J., Smith, T.J.: Periodicity in rectangular arrays. Inf. Process. Lett. 118, 58–63 (2017)

    Article  MathSciNet  Google Scholar 

  16. Giammarresi, D., Restivo, A.: Two-dimensional languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. III, pp. 215–267. Springer, Heidelberg (1997). https://doi.org/10.1007/978-3-642-59126-6_4

    Chapter  Google Scholar 

  17. Kulkarni, M.S., Mahalingam, K.: Two-dimensional palindromes and their properties. In: Drewes, F., Martín-Vide, C., Truthe, B. (eds.) LATA 2017. LNCS, vol. 10168, pp. 155–167. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-53733-7_11

    Chapter  MATH  Google Scholar 

  18. Lee, T., Na, J.C., Park, H., Park, K., Sim, J.S.: Finding consensus and optimal alignment of circular strings. Theor. Comput. Sci. 468, 92–101 (2013)

    Article  MathSciNet  Google Scholar 

  19. Lothaire, M.: Combinatorics on Words. Cambridge University Press, Cambridge (1997)

    Book  Google Scholar 

  20. Marcus, S., Sokol, D.: 2D Lyndon words and applications. Algorithmica 77(1), 116–133 (2017)

    Article  MathSciNet  Google Scholar 

  21. Moczurad, M., Moczurad, W.: Some open problems in decidability of brick (labelled polyomino) codes. In: Chwa, K.-Y., Munro, J.I.J. (eds.) COCOON 2004. LNCS, vol. 3106, pp. 72–81. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-27798-9_10

    Chapter  MATH  Google Scholar 

  22. Perrin, D., Restivo, A.: Enumerative combinatorics on words. In: Bona, M. (ed.) Handbook of Enumerative Combinatorics. CRC Press (2015)

    Google Scholar 

  23. Simplot, D.: A characterization of recognizable picture languages by tilings by finite sets. Theor. Comput. Sci. 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 e Informatica, Università di Catania, Viale Andrea Doria 6/a, 95125, Catania, Italy

    Maria Madonia

  3. LITIS, Université de Rouen Normandie, 76830, Saint Etienne du Rouvray, Rouen, France

    Carla Selmi

Authors
  1. Marcella Anselmo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Maria Madonia
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Carla Selmi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Maria Madonia .

Editor information

Editors and Affiliations

  1. Rovira i Virgili University, Tarragona, Spain

    Carlos Martín-Vide

  2. Saint Petersburg State University, St. Petersburg, Russia

    Alexander Okhotin

  3. Ariel University, Ariel, Israel

    Dana Shapira

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Anselmo, M., Madonia, M., Selmi, C. (2019). Toroidal Codes and Conjugate Pictures. In: Martín-Vide, C., Okhotin, A., Shapira, D. (eds) Language and Automata Theory and Applications. LATA 2019. Lecture Notes in Computer Science(), vol 11417. Springer, Cham. https://doi.org/10.1007/978-3-030-13435-8_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-13435-8_21

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-13434-1

  • Online ISBN: 978-3-030-13435-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation