Axiomatizing the equational theory of regular tree languages: Extended abstract

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1373 LNCS, Issue , 1998, Pages 455-465

  Esik Z ^a  

^a UNIVERSITY OF SZEGED   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

AXIOMATIZATION; AXIOMATIZING; COMPLETE AXIOMATIZATIONS; EQUATIONAL THEORY; EXTENDED ABSTRACTS; FINITE SET OF EQUATIONS; FIXED POINTS; REGULAR TREE LANGUAGES; WORD LANGUAGES;

COMPUTER SCIENCE;

EID: 33750090130     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0028581     Document Type: Conference Paper

References (39)

1. J. Almeida, On pseudovarieties, varieties of languages, filters of congruences, pseudoidentities and related topics, Algebra Universalis, 27(1990), 333-350.
2. J. Almeida, Finite Semigroups and Universal Algebra, Word Scientific, 1994.
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).
4. H. Bekič, Definable operations in general algebras, and the theory of automata and flowcharts, Technical Report, IBM Laboratory, Vienna, 1969.
5. L. Bernátsky, S.L. Bloom, Z. Ésik, Gh. Stefanescu, Equational theories of relations and regular sets, in: Words, Languages, and Combinatorics, Kyoto, 1992, Word Scientific, 1994, 40-48.
6. S.L. Bloom and Z. Ésik, Iteration algebras, Int. J. Foundations of Computer Science, 3(1992), 245-302.
7. S.L. Bloom and Z. Ésik, Equational axioms for regular sets, Mathematical Structures in Computer Science, 3(1993), 1-24.
8. S.L. Bloom and Z. Ésik, Iteration Theories: The Equational Logic of Iterative Processes, EATCS Monographs on Theoretical Computer Science, Springer-Verlag, 1993.
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.
10. S.L. Bloom and Z. Ésik, The logic of fixed points, Theoretical Computer Science, 179(1997), 1-60.
11. M. Boffa, Une remarque sur les systemes complets d'identites rationelles, Theoret. Inform. Appl., 24(1990), 419-423.
12. J.C. Conway, Regular Algebra and Finite Machines, Chapman and Hall, London, 1971.
13. Z. Ésik, Identities in iterative and rational algebraic theories, Computational Linguistics and Computer Languages, 14(1980), 183-207.
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.
15. Z. Ésik, Algebras of iteration theories, J. of Computer and System Sciences, 27(1783), 291-303.
16. Z. Ésik, Completeness of Park induction, Theoretical Computer Science, 177(1997), 217-283.
17. Z. Ésik, Group axioms for iteration, to appear.
18. Z. Ésik, A variety theorem for trees and theories, LITP Report Series, 97/15, May 1997.
19. Z. Ésik, Axiomatizing the equational theory of regular tree languages, Stevens Institute of Technology Research Reports, No. 9703, September 1997.
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.
21. F. Gécseg and M. Steinby, Tree Automata, Akadémiai Kiadó, Budapest, 1984.
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.
23. J. Goguen, J. Thatcher, E. Wagner, and J. Wright, Initial algebra semantics and continuous algebras, J. ACM, 24(1977), 68-95.
24. I. Guessarian, Algebraic Semantics, LNCS 99, Springer-Verlag, 1981.
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.
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.
27. D. Kozen, Results on the propositional μ-calculus, Theoretical Computer Science, 27(1983), 333-354.
28. D. Kozen, A completeness theorem for Kleene algebras azad the algebra of regular events, Information and Computation, 110(1994), 366-390.
29. D. Krob, Complete systems of B-rational identities, Theoretical Computer Science, 89(1991), 207-343.
30. M. Magidor and G. Moran, Finite automata over infinite trees, Technical report No. 30, Hebrew University, 1969.
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.
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).
33. A. Salomaa, Two complete axioms systems for the algebra of regular events, J. of the ACM, 13(1966), 158-169.
34. M. Steinby, Syntactic algebras and varieties of recognizable sets, in: Proc. Coll. Lille, 1979, 226-240.
35. M. Steinby, A theory of tree language varieties, in: Tree Automata and Languages, North-Holland, Amsterdam, 1992, 57-81.
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.
37. W. Thomas, Logical aspects in the study of tree languages, Ninth Colloq. Trees in Algebra and Programming, Cambridge Univ. Press, 1984, 31-49.
38. W. Thomas, Automata on infinite objects, in: Handbook of Theoretical Computer Science, vol. B, North-Holland, 1992, 133-191.
39. Th. Wilke, An algebraic characterization of frontier testable languages, Theoretical Computer Science, 154(1996), 85-106.