Skip to main content
SpringerLink
Log in

Iteration Grove Theories with Applications

Dedicated to Prof. Werner Kuich on the Occasion of His Retirement

  • Conference paper
Algebraic Informatics (CAI 2009)

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

Included in the following conference series:

Abstract

Iteration grove theories are iteration theories equipped with an additive structure satisfying certain one-sided distributivity laws. In any iteration grove theory, the fixed point operation determines and is determined by a generalized star operation that takes familiar form in many applications. We relate properties of the dagger operation to properties of the generalized star operation and present some applications to continuous functions over complete lattices, continuous monoids, and to tree languages.

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. Bekić, H.: Definable operations in genaral algebras and the theory of automata and flowcharts. LNCS, vol. 177, pp. 30–55. Springer, Heidelberg (1984)

    Google Scholar 

  2. Bloom, S.L., Ésik, Z.: Iteration Theories. Springer, Heidelberg (1993)

    Book  MATH  Google Scholar 

  3. Bloom, S.L., Ésik, Z.: An extension theorem with an application to formal tree series. J. of Automata, Languages and Combinatorics 8, 145–185 (2003)

    MathSciNet  MATH  Google Scholar 

  4. Bozapalidis, S.: Equational elements in additive algebras. Theory of Comput. Sys. 32, 1–33 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  5. de Bakker, J.W., Scott, D.: A theory of programs. IBM Seminar, Vienna (1969)

    Google Scholar 

  6. Engelfriet, J., Schmidt, E.M.: IO and OI. I. and II. J. Comput. System Sci. 15, 328–353 (1977); 16, 67–99 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  7. Elgot, C.C.: Matricial theories. J. Algebra 42, 391–421 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  8. Elgot, C.C.: Monadic computation and iterative algebraic theories. In: Logic Colloquium 1973, Bristol. Studies in Logic and the Foundations of Mathematics, vol. 80, pp. 175–230. North-Holland, Amsterdam (1975)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  10. Ésik, Z.: Axiomatizing the equational theory of regular tree languages (extended abstract). In: Meinel, C., Morvan, M. (eds.) STACS 1998. LNCS, vol. 1373, pp. 455–465. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  12. Ésik, Z.: Axiomatizing the least fixed point operation and binary supremum. In: Clote, P.G., Schwichtenberg, H. (eds.) CSL 2000. LNCS, vol. 1862, pp. 302–316. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  13. Ésik, Z.: Continuous additive algebras and injective simulations of synchronization trees. J. Logic and Comutation 12, 271–300 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  14. Gécseg, F., Steinby, M.: Tree Automata. Akadémiai Kiadó, Budapest (1984)

    Google Scholar 

  15. Kuich, W.: Linear systems of equations and automata on distributive multioperator monoids. In: Contributions to general algebra 12, Vienna, 1999, Heyn, Klagenfurt, pp. 247–256 (2000)

    Google Scholar 

  16. Lawvere, F.W.: Functorial semantics of algebraic theories. Proc. Nat. Acad. Sci. U.S.A. 50, 869–872 (1963)

    Article  MathSciNet  MATH  Google Scholar 

  17. Niwinski, D.: Equational μ-calculus. In: Skowron, A. (ed.) SCT 1984. LNCS, vol. 208, pp. 169–176. Springer, Heidelberg (1985)

    Chapter  Google Scholar 

  18. Niwinski, D.: On fixed-point clones (extended abstract). In: Kott, L. (ed.) ICALP 1986. LNCS, vol. 226, pp. 464–473. Springer, Heidelberg (1986)

    Chapter  Google Scholar 

  19. Park, D.M.R.: Fixed point induction and proofs of program properties. In: Michie, D., Meltzer, B. (eds.) Machine Intelligence 5, pp. 59–78. Edinburgh Univ. Press (1970)

    Google Scholar 

  20. Plotkin, G.: Domains. Univeristy of Edinburgh (1983)

    Google Scholar 

  21. Simpson, A., Plotkin, G.: Complete axioms for categorical fixed-point operators. In: 15th Annual IEEE Symposium on Logic in Computer Science, Santa Barbara, CA, pp. 30–41. IEEE Comput. Soc. Press, Los Alamitos (2000)

    Google Scholar 

  22. Wright, J.B., Thatcher, J.W., Wagner, E.G., Goguen, J.A.: Rational algebraic theories and fixed-point solutions. In: 17th Annual Symposium on Foundations of Computer Science, Houston, Tex, pp. 147–158. IEEE Comput. Soc, Long Beach (1976)

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Z. Ésik & T. Hajgató

Authors
  1. Z. Ésik
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. T. Hajgató
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Aristotle University of Thessaloniki, 54124, Thessaloniki, Greece

    Symeon Bozapalidis

  2. Department of Mathematics, Aristotle University of Thessaloniki, 54124, Thessaloniki, Greece

    George Rahonis

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ésik, Z., Hajgató, T. (2009). Iteration Grove Theories with Applications. In: Bozapalidis, S., Rahonis, G. (eds) Algebraic Informatics. CAI 2009. Lecture Notes in Computer Science, vol 5725. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03564-7_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-03564-7_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-03563-0

  • Online ISBN: 978-3-642-03564-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation