Skip to main content
SpringerLink
Log in

The Equational Theory of Fixed Points with Applications to Generalized Language Theory

Dedicated to Prof. Werner Kuich on the Occasion of His 60th Birthday

  • Conference paper
  • First Online:
Book cover Developments in Language Theory (DLT 2001)

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

Included in the following conference series:

Abstract

We review the rudiments of the equational logic of (least) fixed points and provide some of its applications for axiomatization problems with respect to regular languages, tree languages, and synchronization trees.

Partially supported by grants T30511 and T35163 from the National Foundation of Hungary for Scientific Research and the Austrian-Hungarian Action Foundation.

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
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. L. Aceto, Z. Ésik and A. Ingólfsdóttir. A fully equational proof of Parikh’s theorem, BRICS Report Series, RS-01-28, 2001.

    Google Scholar 

  2. J.W. De Bakker and D. Scott. A theory of programs, IBM Seminar, Vienna, 1969.

    Google Scholar 

  3. H. Bekić. Definable operations in general algebra. Technical Report, IBM Laboratory, Vienna, 1969.

    Google Scholar 

  4. L. Bernátsky and Z. Ésik, Semantics of flowchart programs and the free Conway theories. RAIRO Inform. Théor. Appl., 32(1998), 35–78.

    MathSciNet  Google Scholar 

  5. S. L. Bloom and Z. Ésik. Floyd-Hoare logic in iteration theories. J. Assoc. Comput. Mach., 38(1991), 887–934.

    MATH  MathSciNet  Google Scholar 

  6. S. L. Bloom and Z. Ésik. Program correctness and matricial iteration theories. In: Proc. MathematicalFoundations of Programming Semantics’91,LNCS 598, Springer-Verlag, 1992, 457–475.

    Google Scholar 

  7. S. L. Bloom and Z. Ésik. Iteration Theories. Springer-Verlag, 1993.

    Google Scholar 

  8. S. L. Bloom, Z. Ésik and D. Taubner. Iteration theories of synchronization trees. Inform. and Comput., 102(1993), 1–55.

    Article  MATH  MathSciNet  Google Scholar 

  9. S. Bozapalidis. Equational elements in additive algebras. Theory Comput. Syst., 32(1999), 1–33.

    Article  MATH  MathSciNet  Google Scholar 

  10. J. H. Conway. Regular Algebra and Finite Machines, Chapman and Hall, 1971.

    Google Scholar 

  11. B. Courcelle, G. Kahn and J. Vuillemin. Algorithmes d’équivalence et de réduction á des expressions minimales dans une classe d’équations récursives simples. In Proc. ICALP 74, Saarbrücken, LNCS 14, Springer, 200–213.

    Google Scholar 

  12. C. C. Elgot, S. L. Bloom and R. Tindell. On the algebraic structure of rooted trees. J. Comput. System Sci., 16(1978), 362–399.

    Article  MATH  MathSciNet  Google Scholar 

  13. J. Engelfriet and E. M. Schmidt. IO and OI. I. J. Comput. System Sci., 15(1977), 328–353.

    Article  MATH  MathSciNet  Google Scholar 

  14. Z. Ésik. Identities in iterative and rational algebraic theories. Comput. Linguist. Comput. Lang., 14(1980), 183–207.

    MATH  MathSciNet  Google Scholar 

  15. Z. Ésik. Completeness of Park induction. Theoret. Comput. Sci., 177(1997), 217–283.

    Article  MATH  MathSciNet  Google Scholar 

  16. Z. Ésik Axiomatizing the equational theory of regular tree languages. In: Proc. STACS 98, Paris, LNCS 1373, Springer, 1998, 455–466.

    Google Scholar 

  17. Z. Ésik. Group axioms for iteration. Inform. and Comput., 148(1999), 131–180.

    Article  MATH  MathSciNet  Google Scholar 

  18. Z. Ésik. Axiomatizing the least fixed point operation and binary supremum. In: Proc. CSL 2000, LNCS 1862, Springer-Verlag, 302–316.

    Google Scholar 

  19. Z. Ésik and H. Leiß. In preparation.

    Google Scholar 

  20. F. Gécseg and M. Steinby. Tree Automata. Akadémiai Kiadó. Budapest, 1984.

    Google Scholar 

  21. A. Ginzburg. Algebraic theory of automata. Academic Press, NewYork-London, 1968.

    Google Scholar 

  22. J. A. Goguen, J. W. Thatcher, E. G. Wagner and J. B. Wright. Initial algebra semantics and continuous algebras. J. Assoc. Comput. Mach., 24(1977), 68–95.

    MATH  MathSciNet  Google Scholar 

  23. M. W. Hopkins and D. Kozen. Parikh’s theorem in commutative Kleene algebra. In: Proc. IEEE Conf. Logic in Computer Science (LICS’99), IEEE Press, July 1999, 394–401.

    Google Scholar 

  24. D. Kozen. A completeness theorem for Kleene algebras and the algebra of regular events. In: Proc. 1991 IEEE Symposium on Logic in Computer Science (Amsterdam, 1991), and Inform. and Comput., 110(1994), 366–390.

    Google Scholar 

  25. D. Kozen. On Hoare logic and Kleene algebra with tests. In: Proc. IEEE Conf. Logic in Computer Science (LICS’99), IEEE, July 1999, 167–172, and ACM Trans. Computational Logic, 1(2000), 60–76.

    Google Scholar 

  26. D. Krob. Complete systems of B-rational identities. Theoret. Comput. Sci., 89(1991), 207–343.

    Article  MATH  MathSciNet  Google Scholar 

  27. I. Takanami and N. Honda. A characterization of Parikh’s theorem and semilinear sets by commutative semigroups with length. Electronics and Communications in Japan, 52(1969), 179–184.

    MathSciNet  Google Scholar 

  28. W. Kuich. The Kleene and the Parikh theorem in complete semirings. In: Proc. ICALP’ 97, LNCS 267, Springer-Verlag, 212–225.

    Google Scholar 

  29. W. Kuich. Gaussian elimination and a characterization of algebraic power series. In: Proc. Mathematical Foundations of Computer Science, 1998, LNCS 1450, Springer, Berlin, 1998, 512–521.

    Google Scholar 

  30. R. Milner. A complete inference system for a class of regular behaviors. J. Comput. System Sci., 28(1984), 439–466.

    Article  MATH  MathSciNet  Google Scholar 

  31. D. Niwinski. Equational μ-calculus. In: Computation Theory (Zaborów, 1984), LNCS 208, Springer, 1985, 169–176.

    Google Scholar 

  32. R. J. Parikh. esik,zlnemeth@inf.u-szeged.hu On context-free languages. J. Assoc. Comput. Mach., 4(1996), 570–581.

    MathSciNet  Google Scholar 

  33. D. Park. Fixpoint induction and proofs of program properties. In: Machine Intelligence, 5, American Elsevier, NewYork, 1970, 59–78.

    Google Scholar 

  34. D. Park. Concurrency and automata on infinite sequences. In: Proc. GI Conf., LNCS 104, Springer, 1981, 167–183.

    Google Scholar 

  35. D. L. Pilling. Commutative regular equations and Parikh’s theorem. J. London Math. Soc., 6(1973), 663–666.

    Article  MATH  MathSciNet  Google Scholar 

  36. A. Salomaa. Two complete axiom systems for the algebra of regular events. J. Assoc. Comput. Mach., 13(1966), 158–169.

    MATH  MathSciNet  Google Scholar 

  37. J. Tiuryn. Fixed-points and algebras with infinitely long expressions. I. Regular algebras. Fund. Inform., 2(1978/79), 103–127.

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, University of Szeged, P.O.B. 652, 6720, Szeged, Hungary

    Z. Ésik

Authors
  1. Z. Ésik
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Algebra und Computermathematik Abt. für Theoretische Informatik, Technische Universität Wien, Wiedner Hauptstraße 8-10, 1040, Wien, Austria

    Werner Kuich

  2. Department of Computer Science, Leiden University, P.O. Box 9512, 2300, RA Leiden, The Netherlands

    Grzegorz Rozenberg

  3. Turku Centre for Computer Science, Lemminkaisenkatu 14A, 20520, Turku, Finland

    Arto Salomaa

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ésik, Z. (2002). The Equational Theory of Fixed Points with Applications to Generalized Language Theory. In: Kuich, W., Rozenberg, G., Salomaa, A. (eds) Developments in Language Theory. DLT 2001. Lecture Notes in Computer Science, vol 2295. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46011-X_3

Download citation

  • DOI: https://doi.org/10.1007/3-540-46011-X_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43453-5

  • Online ISBN: 978-3-540-46011-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation