Skip to main content

On Schützenberger Products of Semirings

  • Conference paper
Developments in Language Theory (DLT 2010)

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

Included in the following conference series:

Abstract

The Schützenberger product of (ordered) monoids is an essential tool when studying the polynomial operators on Boolean and positive varieties of languages and concatenation hierarchies. Here we consider rather disjunctive varieties of languages and therefore the recognition of languages is by finite idempotent semirings. We define a product of finite idempotent semirings and we show similar results to those concerning Schützenberger products of monoids and ordered monoids.

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 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. Klíma, O., Polák, L.: Hierarchies of piecewise testable languages. In: Ito, M., Toyama, M. (eds.) DLT 2008. LNCS, vol. 5257, pp. 479–490. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  2. Klíma, O., Polák, L.: Polynomial operators on classes of regular languages. In: Bozapalidis, S., Rahonis, G. (eds.) Algebraic Informatics. LNCS, vol. 5725, pp. 260–277. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  3. Pin, J.-E.: Varieties of Formal Languages. North Oxford Academic, Plenum (1986)

    MATH  Google Scholar 

  4. Pin, J.-E.: A variety theorem without complementation. Russian Mathem (Iz. VUZ) 39, 74–83 (1995)

    MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

  6. Pin, J.-E.: Algebraic tools for the concatenation product. Theoretical Computer Science 292, 317–342 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  7. Pin, J.-E., Straubing, H.: Monoids of upper triangular boolean matrices. In: Colloquia Mathematica Societatis Janos Bolyal, pp. 259–272 (1981)

    Google Scholar 

  8. Polák, L.: A classification of rational languages by semilattice-ordered monoids. Arch. Math. (Brno) 40, 395–406 (2004)

    MATH  MathSciNet  Google Scholar 

  9. Rhodes, J., Steinberg, B.: The q-theory of Finite Semigroups. In: Springer Monographs in Mathematics (2009)

    Google Scholar 

  10. Simon, I.: The product of rational languages. In: Lingas, A., Carlsson, S., Karlsson, R. (eds.) ICALP 1993. LNCS, vol. 700, pp. 430–444. Springer, Heidelberg (1993)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Klíma, O., Polák, L. (2010). On Schützenberger Products of Semirings. 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_26

Download citation

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

  • 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