Skip to main content
SpringerLink
Log in

The algebraic equivalent of AFL theory

  • Automata and Formal Languages I
  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1995)

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

Included in the following conference series:

Abstract

We generalize the characterization of abstract families of languages (AFLs) by abstract families of acceptors to Ω-continuous semirings.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Berstel, J.: Transductions and Context-Free Languages. Teubner, 1979.

    Google Scholar 

  2. Berstel, J. et Reutenauer, C.: Les séries rationelles et leur langages. Masson, 1984.

    Google Scholar 

  3. Ginsburg, S.: Algebraic and Automata-Theoretic Properties of Formal Languages. North-Holland, 1975.

    Google Scholar 

  4. Golan, J. S.: The Theory of Semirings with Applications in Mathematics and Theoretical Computer Science. Longman 1992.

    Google Scholar 

  5. Goldstern, M.: VervollstÄndigung von Halbringen. Diplomarbeit Technische UniversitÄt Wien, 1985.

    Google Scholar 

  6. Hebisch, U. und Weinert, H. J.: Halbringe. Teubner, 1993.

    Google Scholar 

  7. Karner, G.: On limits in complete semirings. Semigroup Forum 45(1992) 148–165.

    Google Scholar 

  8. Karner, G.: On transductions of formal power series over complete semirings. Theoretical Computer Science 98(1992) 27–39.

    Google Scholar 

  9. Krob, D.: The equality problem for rational series with multiplicities in the tropical semiring is undecidable. ICALP92, LNCS 623, 101–112.

    Google Scholar 

  10. Kuich, W.: The Kleene and the Parikh Theorem in Complete Semirings. ICALP 87, LNCS 267(1987) 212–225.

    Google Scholar 

  11. Kuich, W.: Ω-continuous semirings, algebraic systems and pushdown automata. ICALP 90, LNCS 443(1990) 103–110.

    Google Scholar 

  12. Kuich, W.: Automata and languages generalized to Ω-continuous semirings. Theoretical Computer Science 79(1991) 137–150.

    Google Scholar 

  13. Kuich, W.: Automaten und Formale Sprachen. Skriptum Technische UniversitÄt Wien, 1991.

    Google Scholar 

  14. Kuich, W. and Salomaa, A.: Semirings, Automata, Languages. Springer, 1986.

    Google Scholar 

  15. Salomaa, A. and Soittola, M.: Automata-Theoretic Aspects of Formal Power Series. Springer, 1978.

    Google Scholar 

  16. Simon, I.: Recognizable sets with multiplicities in the tropical semiring. MFCS88, LNCS 324, 107–120.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Algebra und Diskrete Mathematik Abteilung für Theoretische Informatik, Technische UniversitÄt Wien, Wiedner Hauptstra\e 8-10, A-1040, Wien

    Werner Kuich

Authors
  1. Werner Kuich
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Zoltán Fülöp Ferenc Gécseg

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kuich, W. (1995). The algebraic equivalent of AFL theory. In: Fülöp, Z., Gécseg, F. (eds) Automata, Languages and Programming. ICALP 1995. Lecture Notes in Computer Science, vol 944. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60084-1_61

Download citation

  • DOI: https://doi.org/10.1007/3-540-60084-1_61

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60084-8

  • Online ISBN: 978-3-540-49425-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation