Skip to main content
SpringerLink
Log in

A Unifying Kleene Theorem for Weighted Finite Automata

  • Chapter
Rainbow of Computer Science

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

Abstract

We state two variants of the Theorem of Kleene-Schützenberger: one for arbitrary semirings and proper finite automata; the other for Conway semirings and arbitrary finite automata. Considering finite automata over partial Conway semirings over an ideal, we show that these two variants are special cases of a unifying theorem.

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

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. Berstel, J., Reutenauer, C.: Les séries rationelles et leurs langages. Masson (1984); English translation: Rational Series and Their Languages. EATCS Monographs on Theoretical Computer Science, vol. 12. Springer, Heidelberg (1988)

    Google Scholar 

  2. Bloom, S.L., Ésik, Z.: Iteration Theories. EATCS Monographs on Theoretical Computer Science. Springer, Heidelberg (1993)

    Book  MATH  Google Scholar 

  3. Bloom, S.L., Ésik, Z., Kuich, W.: Partial Conway and iteration semirings. Fund. Inform. 86, 19–40 (2008)

    MathSciNet  MATH  Google Scholar 

  4. Conway, J.H.: Regular Algebra and Finite Machines. Chapman & Hall, Boca Raton (1971)

    MATH  Google Scholar 

  5. Droste, M., Kuich, W.: Semirings and formal power series. In: Droste, M., Kuich, W., Vogler, H. (eds.) Handbook of Weighted Automata. EATCS Monographs on Theoretical Computer Science, pp. 3–28. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  6. Eilenberg, S.: Automata, Languages and Machines, vol. A. Academic Press, London (1974)

    MATH  Google Scholar 

  7. Ésik, Z., Kuich, W.: Inductive *-semirings. Theoretical Computer Science 324, 3–33 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  8. Ésik, Z., Kuich, W.: Modern Automata Theory, http://www.dmg.tuwien.ac.at/kuich

  9. Hebisch, U.: The Kleene theorem in countably complete semirings. Bayreuther Mathematische Schriften 31, 55–66 (1990)

    MathSciNet  MATH  Google Scholar 

  10. Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)

    MATH  Google Scholar 

  11. Kleene, S.C.: Representation of events in nerve nets and finite automata. In: Shannon, C.E., McCarthy, J. (eds.) Automata Studies, pp. 3–41. Princeton University Press, Princeton (1956)

    Google Scholar 

  12. Kuich, W.: The Kleene and the Parikh theorem in complete semirings. In: Ottmann, T. (ed.) ICALP 1987. LNCS, vol. 267, pp. 212–225. Springer, Heidelberg (1987)

    Chapter  Google Scholar 

  13. Kuich, W.: Semirings and formal power series: Their relevance to formal languages and automata theory. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, ch. 9, vol. 1, pp. 609–677. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  14. Kuich, W., Salomaa, A.: Semirings, Automata, Languages. EATCS Monographs on Theoretical Computer Science, vol. 5. Springer, Heidelberg (1986)

    Book  MATH  Google Scholar 

  15. Maurer, H.: Theoretische Grundlagen der Programmiersprachen. B.I. Wissenschaftsverlag (1969)

    Google Scholar 

  16. Salomaa, A.: Formal Languages. Academic Press, London (1973)

    MATH  Google Scholar 

  17. Salomaa, A., Soittola, M.: Automata-Theoretic Aspects of Formal Power Series. Springer, Heidelberg (1978)

    Book  MATH  Google Scholar 

  18. Schützenberger, M.P.: On the definition of a family of automata. Inf. Control 4, 245–270 (1961)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, University of Szeged, Hungary

    Zoltán Ésik

  2. Institut für Diskrete Mathematik und Geometrie, Technische Universität Wien, Austria

    Werner Kuich

Authors
  1. Zoltán Ésik
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Werner Kuich
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Science Centre, The University of Auckland, 38 Princes Street, 1142, Auckland, New Zealand

    Cristian S. Calude

  2. Leiden Institute of Center Advanced Computer Science (LIACS), Leiden University, Niels Bohrweg 1, 2333, Leiden, CA, The Netherlands

    Grzegorz Rozenberg

  3. Turku Centre for Computer Science (TUCS), University of Turku, Leminkäisenkatu 14, 20014, Turku, Finland

    Arto Salomaa

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Ésik, Z., Kuich, W. (2011). A Unifying Kleene Theorem for Weighted Finite Automata. In: Calude, C.S., Rozenberg, G., Salomaa, A. (eds) Rainbow of Computer Science. Lecture Notes in Computer Science, vol 6570. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-19391-0_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-19391-0_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-19390-3

  • Online ISBN: 978-3-642-19391-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation