Skip to main content
SpringerLink
Log in

An Eilenberg Theorem for Pictures

  • Conference paper
Algebraic Informatics (CAI 2009)

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

Included in the following conference series:

Abstract

Picture language recognizability by 2-monoids is shown to be equivalent to recognizability by frame action. Then we establish a bijection between the pseudovarieties of finite 2-monoids and varieties of frame recognizable picture languages.

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. Bozapalidis, S., Grammatikopoulou, A.: Picture Codes. RAIRO: Theoretical Informatics and Applications 40, 537–550 (2006)

    MathSciNet  MATH  Google Scholar 

  2. Bozapalidis, S., Grammatikopoulou, A.: Recognizable Picture Series. Journal of Automata, Languages and Combinatorics 10(2/3), 159–183 (2005)

    MathSciNet  MATH  Google Scholar 

  3. Bozapalidis, S.: Picture Deformation. Acta Informatica 45, 1–31 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  4. Eilenberg, S.: Automata, Languages and Machines, vol. B. Academic Press, New York (1977)

    MATH  Google Scholar 

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

  6. Salehi, S., Steinby, M.: Varieties of many-sorted recognizable sets. PU.M.A 18, 319–343 (2007)

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Aristotle University of Thessaloniki, 54124, Thessaloniki, Greece

    Symeon Bozapalidis & Archontia Grammatikopoulou

Authors
  1. Symeon Bozapalidis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Archontia Grammatikopoulou
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Aristotle University of Thessaloniki, 54124, Thessaloniki, Greece

    Symeon Bozapalidis

  2. Department of Mathematics, Aristotle University of Thessaloniki, 54124, Thessaloniki, Greece

    George Rahonis

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bozapalidis, S., Grammatikopoulou, A. (2009). An Eilenberg Theorem for Pictures. In: Bozapalidis, S., Rahonis, G. (eds) Algebraic Informatics. CAI 2009. Lecture Notes in Computer Science, vol 5725. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03564-7_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-03564-7_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-03563-0

  • Online ISBN: 978-3-642-03564-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation