Skip to main content
SpringerLink
Log in

Fixed Point Theory

  • Chapter
  • First Online:
Handbook of Weighted Automata

Abstract

Fixed points and fixed point computations occur in just about every field of Computer Science. It has been noticed that several fundamental theorems are consequences of just a few equational properties of fixed point operations. This chapter gives an introduction to that part of the theory of fixed points that has applications to weighted automata and languages.

The author was partially supported by grant no. MTM2007-63422 from the Ministry of Education and Science of Spain.

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 189.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 249.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 249.99
Price excludes VAT (USA)
  • Durable hardcover 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. A. Arnold and D. Niwinski. Rudiments of μ -Calculus. Elsevier, Amsterdam, 2001.

    Google Scholar 

  2. S. Banach. Sur les operations dans les ensembles abstraits et leur applications aux équations intégrales. Fundamenta Mathematicae, 22:133–181, 1922.

    Google Scholar 

  3. M. Barr and C. Wells. Category Theory for Computing Science. Prentice Hall International, Englewood Cliffs, 1990.

    MATH  Google Scholar 

  4. H. Bekić. Definable operations in general algebras, and the theory of automata and flowcharts. Technical Report, IBM Laboratory, Vienna, 1969.

    Google Scholar 

  5. L. Bernátsky and Z. Ésik. Semantics of flowchart programs and the free Conway theories. Theoretical Informatics and Applications, RAIRO, 32:35–78, 1998.

    Google Scholar 

  6. S.L. Bloom, C.C. Elgot, and J.B. Wright. Solutions of the iteration equation and extension of the scalar iteration operation. SIAM Journal on Computing, 9:26–45, 1980.

    Google Scholar 

  7. S.L. Bloom, C.C. Elgot, and J.B. Wright. Vector iteration of pointed iterative theories. SIAM Journal on Computing, 9:525–540, 1980.

    Article  MATH  MathSciNet  Google Scholar 

  8. S.L. Bloom and Z. Ésik. Axiomatizing schemes and their behaviors. Journal of Computer and System Sciences, 31:375–393, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  9. S.L. Bloom and Z. Ésik. Iteration Theories: The Equational Logic of Iterative Processes. Monographs in Theoretical Computer Science. An EATCS Series, Springer, Berlin, 1993.

    MATH  Google Scholar 

  10. S.L. Bloom and Z. Ésik. Two axiomatizations of a star semiring quasi-variety. Bulletin of the European Association for Theoretical Computer Science, 59:150–152, 1996.

    MATH  Google Scholar 

  11. S.L. Bloom and Z. Ésik. The equational logic of fixed points. Theoretical Computer Science, 179:1–60, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  12. S.L. Bloom and Z. Ésik. Axiomatizing rational power series. Information and Computation, 207:793–811, 2009.

    Article  MATH  MathSciNet  Google Scholar 

  13. S.L. Bloom S. Ginali, and J. Rutledge. Scalar and vector iteration. Journal of Computer and System Sciences, 14:251–256, 1977.

    MATH  MathSciNet  Google Scholar 

  14. M. Boffa. Une remarque sur les systèmes complets d’identités rationnelles. (A remark on complete systems of rational identities). Theoretical Informatics and Applications, RAIRO, 24:419–423, 1990 (in French).

    MATH  MathSciNet  Google Scholar 

  15. M. Boffa. Une condition impliquant toutes les identités rationnelles (A condition implying all rational identities). Theoretical Informatics and Applications, RAIRO, 29:515–518, 1995 (in French).

    MATH  MathSciNet  Google Scholar 

  16. P.M. Cohn. Universal Algebra. Harper & Row, New York, 1965.

    MATH  Google Scholar 

  17. J.C. Conway. Regular Algebra and Finite Machines. Chapman & Hall, London, 1971.

    MATH  Google Scholar 

  18. 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, volume 14 of Lecture Notes in Computer Science, pages 200–213. Springer, Berlin, 1974.

    Google Scholar 

  19. B.A. Davey and H.A. Priestley. Introduction to Lattices and Order, 2nd edition, Cambridge University Press, Cambridge, 2002.

    MATH  Google Scholar 

  20. J.W. De Bakker and D. Scott. A theory of programs. Technical Report, IBM Vienna, 1969.

    Google Scholar 

  21. M. Droste and W. Kuich. Semirings and formal power series. In W. Kuich, M. Droste, and H. Vogler, editors. Handbook of Weighted Automata. Chapter 1. Springer, Berlin, 2009.

    Google Scholar 

  22. C.C. Elgot. Monadic computation and iterative algebraic theories. In J.C. Shepherdson, editor, Logic Colloquium 1973, volume 80 of Studies in Logic, pages 175–230. North-Holland, Amsterdam, 1975.

    Chapter  Google Scholar 

  23. C.C. Elgot. Matricial theories. Journal of Algebra, 42:391–421, 1976.

    Article  MATH  MathSciNet  Google Scholar 

  24. Z. Ésik. Identities in iterative algebraic theories. Computational Linguistics and Computer Languages, 14:183–207, 1980.

    MATH  MathSciNet  Google Scholar 

  25. Z. Ésik. A note on the axiomatization of iteration theories. Acta Cybernetica, 9:375–384, 1990.

    MATH  MathSciNet  Google Scholar 

  26. Z. Ésik. Completeness of Park induction. Theoretical Computer Science, 177:217–283, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  27. Z. Ésik. Group axioms for iteration. Information and Computation, 148:131–180, 1999.

    Article  MATH  MathSciNet  Google Scholar 

  28. Z. Ésik. Iteration theories of boolean functions. In Math. Found. of Computer Science, 2000, volume 1893 of Lecture Notes in Computer Science, pages 343–352. Springer, Berlin, 2000.

    Chapter  Google Scholar 

  29. Z. Ésik. Iteration semirings. In Proc. DLT 08, volume 5257 of Lecture Notes in Computer Science, pages 1–20. Springer, Berlin, 2008.

    Google Scholar 

  30. Z. Ésik and W. Kuich. Rationally additive semirings. Journal of Universal Computer Science, 2(8):173–183, 2002.

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  32. Z. Ésik and W. Kuich. On iteration semiring–semimodule pairs. Semigroup Forum, 75:129–159, 2007.

    Article  MATH  MathSciNet  Google Scholar 

  33. Z. Ésik and W. Kuich. Finite automata. In W. Kuich, M. Droste, and H. Vogler, editors, Handbook of Weighted Automata. Chapter 3. Springer, Berlin, 2009.

    Google Scholar 

  34. Z. Ésik and A. Labella. Equational properties of iteration in algebraically complete categories. Theoretical Computer Science, 195:61–89, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  35. J.S. Golan. The Theory of Semirings with Applications in Computer Science. Longman, Harlow, 1993.

    Google Scholar 

  36. M. Hasegawa. Recursion from cyclic sharing: Traced monoidal categories and models of cyclic lambda calculi. In Typed Lambda Calculi and Applications, Nancy, 1997, volume 1210 of Lecture Notes in Computer Science, pages 196–213. Springer, Berlin, 1997.

    Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

  38. A. Joyal, R. Street, and D. Verity. Traced monoidal categories. Mathematical Proceedings of the Cambridge Philosophical Society, 119:447–468, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  39. D. Kozen. On Kleene algebras and closed semirings. In Proc. MFCS’90, volume 452 of Lecture Notes in Computer Science, pages 26–47. Springer, Berlin, 1990.

    Google Scholar 

  40. D. Kozen. A completeness theorem for Kleene algebras and the algebra of regular events. Information and Computation, 110:366–390, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  41. D. Krob. Complete systems of B-rational identities. Theoretical Computer Science, 89:207–343, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  42. F.W. Lawvere. Functorial semantics of algebraic theories. Proceedings of the National Academy of Sciences of the United States of America, 50:869–873, 1963.

    Article  MATH  MathSciNet  Google Scholar 

  43. G. Markowsky. Chain-complete posets and directed sets with applications. Algebra Universalis, 6:53–68, 1976.

    Article  MATH  MathSciNet  Google Scholar 

  44. D. Niwinski. Equational μ-calculus. In Computation Theory, Zaborów, 1984, volume 208 of Lecture Notes in Computer Science, pages 169–176. Springer, Berlin, 1985.

    Google Scholar 

  45. D. Niwinski. On fixed-point clones. In Proc. ICALP’86, volume 226 of Lecture Notes in Computer Science, pages 464–473. Springer, Berlin, 1986.

    Google Scholar 

  46. D. Perrin and J.-E. Pin. Infinite Words, volume 141 of Pure and Applied Mathematics. Elsevier, Amsterdam, 2004.

    MATH  Google Scholar 

  47. G.D. Plotkin. Domains. Lecture Notes, Department of Computer Science, University of Edinburgh, 1983.

    Google Scholar 

  48. A. Simpson and G. Plotkin. Complete axioms for categorical fixed-point operators. In 15th Annual IEEE Symposium on Logic in Computer Science, Santa Barbara, CA, 2000, pages 30–41. IEEE Computer Society, Los Alamitos, 2000.

    Google Scholar 

  49. Gh. Stefanescu. Network Algebra. Springer, Berlin, 2000.

    MATH  Google Scholar 

  50. A. Tarski. A lattice theoretical fixpoint theorem and its applications. Pacific Journal of Mathematics, 5:285–309, 1955.

    MATH  MathSciNet  Google Scholar 

  51. J.B. Wright, J.W. Thatcher, J. Goguen, and E.G. Wagner. Rational algebraic theories and fixed-point solutions. In Proceedings 17th IEEE Symposium on Foundations of Computing, Houston, Texas, pages 147–158, 1976.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Szeged, Szeged, Hungary

    Zoltán Ésik

  2. Rovira i Virgili University, Tarragona, Spain

    Zoltán Ésik

Authors
  1. Zoltán Ésik
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Inst. Informatik, Universität Leipzig, Augustusplatz 10-11, Leipzig, 04109, Germany

    Manfred Droste

  2. Institut für Diskrete, TU Wien, Wiedner Hauptstr. 8-10, Wien, 1040, Austria

    Werner Kuich

  3. Fak. Informatik, TU Dresden, Nöthnitzer Str. 46, Dresden, 01187, Germany

    Heiko Vogler

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Ésik, Z. (2009). Fixed Point Theory. In: Droste, M., Kuich, W., Vogler, H. (eds) Handbook of Weighted Automata. Monographs in Theoretical Computer Science. An EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01492-5_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-01492-5_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-01491-8

  • Online ISBN: 978-3-642-01492-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation