Skip to main content

On Pseudovarieties of Semiring Homomorphisms

  • Conference paper
Mathematical Foundations of Computer Science 2004 (MFCS 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3153))

Abstract

We formulate and prove here an Eilenberg- and Reiterman-type theorems for pseudovarieties of idempotent semiring homomorphi-sms. We also initiate the study of quite significant classes of languages – the so-called multiliteral varieties of regular languages. Finally we show how other Eilenberg-type theorems follow from our considerations.

MSC 2000 Classification: 68Q45 Formal languages and automata

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Almeida, J.: Finite Semigroups and Universal Algebra. World Scientific, Singapore (1994)

    MATH  Google Scholar 

  2. Kunc, M.: Equational description of pseudovarieties of homomorphisms. RAIRO - Theoretical Informatics and Applications 37, 243–254 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  3. Pin, J.-E.: Syntactic semigroups. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, ch. 10, Springer, Heidelberg (1997)

    Google Scholar 

  4. Polák, L.: A classification of rational languages by semilattice-ordered monoids, Archivum Mathematicum (to appear), see also http://www.math.muni.cz/~polak

  5. Polák, L.: Syntactic semiring of a language. In: Sgall, J., Pultr, A., Kolman, P. (eds.) MFCS 2001. LNCS, vol. 2136, pp. 611–620. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  6. Polák, L.: Syntactic semiring and language equations. In: Champarnaud, J.-M., Maurel, D. (eds.) CIAA 2002. LNCS, vol. 2608, pp. 182–193. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  7. Polák, L.: Syntactic semiring and universal automaton. In: Ésik, Z., Fülöp, Z. (eds.) DLT 2003. LNCS, vol. 2710, pp. 411–422. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  8. Straubing, H.: On logical descriptions of regular languages. In: Rajsbaum, S. (ed.) LATIN 2002. LNCS, vol. 2286, pp. 528–538. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Polák, L. (2004). On Pseudovarieties of Semiring Homomorphisms. In: Fiala, J., Koubek, V., Kratochvíl, J. (eds) Mathematical Foundations of Computer Science 2004. MFCS 2004. Lecture Notes in Computer Science, vol 3153. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-28629-5_49

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-28629-5_49

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22823-3

  • Online ISBN: 978-3-540-28629-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics