Skip to main content
SpringerLink
Log in

Axiomatizing the equational theory of regular tree languages

Extended Abstract

  • Logic II
  • Conference paper
  • First Online:
STACS 98 (STACS 1998)

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

Included in the following conference series:

Abstract

We show that a finite set of equation schemes together with the least fixed point rule gives a complete axiomatization of the valid identities of regular tree languages. This result is a generalization of Kozen's axiomatization of the equational theory of regular word languages.

Partially supported by grant T22423 of the National Foundation of Hungary for Scientific Research, the US-Hungarian Joint Fund under grant no. 351, the Fulbright Commission, and by the French-Hungarian Science and Technology Bilateral Governmental Program financed by the OMFB and its French partner: “Le Ministére des Affaires Entragéres”

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. J. Almeida, On pseudovarieties, varieties of languages, filters of congruences, pseudoidentities and related topics, Algebra Universalis, 27 (1990), 333–350.

    Article  MATH  MathSciNet  Google Scholar 

  2. J. Almeida, Finite Semigroups and Universal Algebra, Word Scientific, 1994.

    Google Scholar 

  3. K.V. Archangelsky and P.V. Gorshkov, Implicational axioms for the algebra of regular events, Dokl. Akad. Nauk USSR Ser A, 10 (1987), 67–69 (in Russian).

    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, S.L. Bloom, Z. É, Gh. Stefanescu, Equational theories of relations and regular sets, in: Words, Languages, and Combinatorics, Kyoto, 1992, Word Scientific, 1994, 40–48.

    Google Scholar 

  6. S.L. Bloom and Z. Ésik, Iteration algebras, Int. J. Foundations of Computer Science, 3 (1992), 245–302.

    Article  MATH  Google Scholar 

  7. S.L. Bloom and Z. Ésik, Equational axioms for regular sets, Mathematical Structures in Computer Science, 3 (1993), 1–24.

    Article  MATH  Google Scholar 

  8. S.L. Bloom and Z. Ésik, Iteration Theories: The Equational Logic of Iterative Processes, EATCS Monographs on Theoretical Computer Science, Springer-Verlag, 1993.

    Google Scholar 

  9. S.L. Bloom and Z. Ésik, Solving polynomial fixed point equations, in: Mathematical Foundations of Computer Science '94. LNCS 841, Springer-Verlag, 1994, 52–67.

    Google Scholar 

  10. S.L. Bloom and Z. Ésik, The logic of fixed points, Theoretical Computer Science, 179 (1997), 1–60.

    Article  MATH  MathSciNet  Google Scholar 

  11. M. Boffa, Une remarque sur les systemes complets d'identites rationelles, Theoret. Inform. Appl., 24 (1990), 419–423.

    MATH  MathSciNet  Google Scholar 

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

    MATH  Google Scholar 

  13. Z. Ésik, Identities in iterative and rational algebraic theories, Computational Linguistics and Computer Languages, 14 (1980), 183–207.

    MATH  MathSciNet  Google Scholar 

  14. Z. Ésik, An axiomatization of regular forests in the language of algebraic theories with iteration, in: Fundamentals of Computation Theory, Szeged, 1981, LNCS 117, Springer-Verlag, 130–136.

    Google Scholar 

  15. Z. Ésik, Algebras of iteration theories,J. of Computer and System Sciences, 27 (1983), 291–303.

    Article  MATH  Google Scholar 

  16. Z. Ésik, Completeness of Park induction,Theoretical Computer Science, 177 (1997), 217–283.

    Article  MATH  MathSciNet  Google Scholar 

  17. Z. Ésik, Group axioms for iteration, to appear.

    Google Scholar 

  18. Z. Ésik, A variety theorem for trees and theories, LITP Report Series, 97/15, May 1997.

    Google Scholar 

  19. Z. Ésik, Axiomatizing the equational theory of regular tree languages, Stevens Institute of Technology Research Reports, No. 9703, September 1997.

    Google Scholar 

  20. Z. Ésik and A. Labella, Equational properties of iteration in algebraically complete categories, Theoretical Computer Science, to appear. Extended abstract in: Proc. MFCS '96, LNCS 1113, Springer-Verlag, 1996, 336–247.

    Google Scholar 

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

    Google Scholar 

  22. F. Gécseg and M. Steinby, Tree languages, in: Handbook of Formal Languages, vol. 3, eds.: G. Rozenberg and A. Salomaa, Springer-Verlag, 1997, 1–68.

    Google Scholar 

  23. J. Goguen, J. Thatcher, E. Wagner, and J. Wright, Initial algebra semantics and continuous algebras, J. ACM, 24 (1977), 68–95.

    Article  MATH  MathSciNet  Google Scholar 

  24. I. Guessarian, Algebraic Semantics, LNCS 99, Springer-Verlag, 1981.

    Google Scholar 

  25. A.J.C. Hurkens, M. McArthur, Y.N. Moschovakis, L.S. Moss and G. Whitney, The logic of recursive equations, J. of Symbolic Logic, to appear.

    Google Scholar 

  26. T. Ito and S. Ando, A complete axiom system of super-regular expressions, in: Information Processing 74, Amagasaki, Japan, North-Holland, 1974, 661–665.

    Google Scholar 

  27. D. Kozen, Results on the propositional μ-calculus, Theoretical Computer Science, 27 (1983), 333–354.

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  29. D. Krob, Complete systems of B-rational identities, Theoretical Computer Science, 89 (1991), 207–343.

    Article  MATH  MathSciNet  Google Scholar 

  30. M. Magidor and G. Moran, Finite automata over infinite trees, Technical report No. 30, Hebrew University, 1969.

    Google Scholar 

  31. D.M.R. Park, Fixpoint induction and proofs of program properties, in: Machine Intelligence 5, D. Michie and B. Meltzer, Eds., Edinburgh Univ. Press, 1970, 59–78.

    Google Scholar 

  32. V.N. Redko, On the determining totality of relations of an algebra of regular events, Ukrain. Mat. Z., 16 (1964), 120–126 (in Russian).

    MathSciNet  Google Scholar 

  33. A. Salomaa, Two complete axioms systems for the algebra of regular events, J. of the ACM, 13 (1966), 158–169.

    Article  MATH  MathSciNet  Google Scholar 

  34. M. Steinby, Syntactic algebras and varieties of recognizable sets, in: Proc. Coll. Lille, 1979, 226–240.

    Google Scholar 

  35. M. Steinby, A theory of tree language varieties, in: Tree Automata and Languages, North-Holland, Amsterdam, 1992, 57–81.

    Google Scholar 

  36. J.W. Thatcher and J.B. Wright, Generalized finite automata theory with an application to a decision problem of second order logic, Mathematical System Theory, 2 (1968), 57–81.

    Article  MathSciNet  Google Scholar 

  37. W. Thomas, Logical aspects in the study of tree languages, Ninth Colloq. Trees in Algebra and Programming, Cambridge Univ. Press, 1984, 31–49.

    Google Scholar 

  38. W. Thomas, Automata on infinite objects, in: Handbook of Theoretical Computer Science, vol. B, North-Holland, 1992, 133–191.

    Google Scholar 

  39. Th. Wilke, An algebraic characterization of frontier testable languages, Theoretical Computer Science, 154 (1996), 85–106.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, József Attila University, Árpád tér 2, 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

Michel Morvan Christoph Meinel Daniel Krob

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag

About this paper

Cite this paper

Ésik, Z. (1998). Axiomatizing the equational theory of regular tree languages. In: Morvan, M., Meinel, C., Krob, D. (eds) STACS 98. STACS 1998. Lecture Notes in Computer Science, vol 1373. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028581

Download citation

  • DOI: https://doi.org/10.1007/BFb0028581

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-69705-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation