Skip to main content

A Semiring-Semimodule Generalization of ω-Context-Free Languages

  • Chapter
Theory Is Forever

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

Abstract

We develop an algebraic theory on semiring-semimodule pairs for ω-context-free languages. We define ω-algebraic systems and characterize their solutions of order k by behaviors of algebraic finite automata. These solutions are then set in correspondence to ω-context-free languages.

Partially supported by Aktion Österreich-Ungarn, Wissenschafts- und Erziehungskooperation, Projekt 53ÖU1. Additionally, the first author was supported, in part, by the National Foundation of Hungary for Scientific Research, grant T 35163.

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

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 16.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. Berstel, J.: Transductions and Context-Free Languages, Teubner (1979)

    Google Scholar 

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

    MATH  Google Scholar 

  3. Cohen, R.S., Gold, A.Y.: Theory of ω-languages I: Characterizations of ω-contextfree languages. JCSS 15, 169–184 (1977)

    MATH  MathSciNet  Google Scholar 

  4. Elgot, C.: Matricial theories. J. Algebra 42, 391–422 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  5. Ésik, Z., Kuich, W.: On iteration semiring-semimodule pairs (to appear)

    Google Scholar 

  6. Ésik, Z., Kuich, W.: A semiring-semimodule generalization of ω-regular languages I. Technical Report, Technische Universität Wien (2003)

    Google Scholar 

  7. Ésik, Z., Kuich, W.: A semiring-semimodule generalization of ω-regular languages II. Technical Report, Technische Universität Wien (2003)

    Google Scholar 

  8. Ginsburg, S., Rice, H.G.: Two families of languages related to ALGOL. J. Assoc. Comput. Mach. 9, 350–371 (1962)

    MathSciNet  Google Scholar 

  9. 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)

    Google Scholar 

  10. Lausch, H., Nöbauer, W.: Algebra of Polynomials. North-Holland, Amsterdam (1973)

    MATH  Google Scholar 

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

    MATH  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 chapter

Cite this chapter

Ésik, Z., Kuich, W. (2004). A Semiring-Semimodule Generalization of ω-Context-Free Languages. In: Karhumäki, J., Maurer, H., Păun, G., Rozenberg, G. (eds) Theory Is Forever. Lecture Notes in Computer Science, vol 3113. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27812-2_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-27812-2_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22393-1

  • Online ISBN: 978-3-540-27812-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics