Algebraic recognizability of regular tree languages

Theoretical Computer Science

Volumn 340, Issue 2, 2005, Pages 291-321

  Ésik, Zoltán ^a,b   Weil, Pascal ^c  

^a UNIVERSITY OF SZEGED   (Hungary)

^b UNIVERSITAT ROVIRA I VIRGILI   (Spain)

^c UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

Preclones; Pseudovariety; Recognizability; Regular tree languages; Variety theorem

Indexed keywords

ALGEBRA; ALGORITHMS; AUTOMATA THEORY; SET THEORY; SYNTACTICS; THEOREM PROVING; TREES (MATHEMATICS);

PRECLONES; PSEUDOVARIETY; RECOGNIZABILITY; REGULAR TREE LANGUAGES; VARIETY THEOREM;

FORMAL LANGUAGES;

EID: 20344402775     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.03.038     Document Type: Article

References (42)

1. J. Almeida On pseudovarieties, varieties of languages, filters of congruences, pseudoidentities and related topics Algebra Univ. 27 1990 333 350
2. A. Arnold, M. Dauchet, Théorie des magmoïdes I and II, RAIRO Theoret. Inform. Appl. 12 (1978), 235-257;
3. A. Arnold, M. Dauchet, Théorie des magmoïdes I and II, RAIRO Theoret. Inform. Appl. 3 (1979) 135-154 (in French).
4. M. Benedikt, L. Ségoufin, Regular tree languages definable in FO, in: V. Diekert, B. Durand (Eds.), STACS 2005, Lecture Notes in Computer Science, vol. 3404, Springer, Berlin, pp. 327-339.
5. S.L. Bloom, and Z. Ésik Iteration Theories 1993 Springer Berlin
6. M. Bojańczyk, I. Walukiewicz, Characterizing EF and EX tree logics, in: P. Gardner, N. Yoshida (Eds.), CONCUR 2004, Lecture Notes in Computer Science, Vol. 3170, Springer, Berlin, 2004.
7. J.R. Büchi Weak second-order arithmetic and finite automata Z. Math. Logik Grundlagen Math. 6 1960 66 92
8. J. Cohen, J.-E. Pin, and D. Perrin On the expressive power of temporal logic J. Comput. System Sci. 46 1993 271 294
9. H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, M. Tommasi, Tree Automata Techniques and Applications, available on: http://www.grappa.univ-lille3.fr/tata (release October 2002).
10. B. Courcelle The monadic second-order logic of graphs. I. Recognizable sets of finite graphs Inform. and Comput. 85 1990 12 75
11. B. Courcelle Basic notions of universal algebra for language theory and graph grammars Theoret. Comput. Sci. 163 1996 1 54
12. B. Courcelle The expression of graph properties and graph transformations in monadic second order logic G. Rozenberg Handbook of Graph Grammars and Computing by Graph Transformations Vol. 1 1997 World Scientific Singapore 313 400
13. B. Courcelle, P. Weil, The recognizability of sets of graphs is a robust property, Theoret. Comput. Sci. to appear.
14. K. Denecke, and S.L. Wismath Universal Algebra and Applications in Theoretical Computer Science 2002 Chapman & Hall New York
15. V. Diekert Combinatorics on Traces Lecture Notes in Computer Science Vol. 454 1987 Springer Berlin
16. J. Doner Tree acceptors and some of their applications J. Comput. System Sci. 4 1970 406 451
17. S. Eilenberg, Automata, Languages, and Machines, Vols. A and B, Academic Press, New York, 1974, 1976.
18. S. Eilenberg, and J.B. Wright Automata in general algebras Inform. and Control 11 1967 452 470
19. C.C. Elgot Decision problems of finite automata design and related arithmetics Trans. Amer. Math. Soc. 98 1961 21 51
20. Z. Ésik A variety theorem for trees and theories Publ. Math. 54 1999 711 762
21. Z. Ésik, P. Weil, On logically defined recognizable tree languages, in: P.K. Pandya, J. Radhakrishnan (Eds.), Proc. FST TCS 2003, Lecture Notes in Computer Science, Vol. 2914, Springer, Berlin, 2003, pp. 195-207.
22. Z. Ésik, P. Weil, Algebraic characterization of logically defined tree languages, in preparation.
23. D.M. Gabbay, A. Pnueli, S. Shelah, J. Stavi, On the temporal analysis of fairness, in: Proc. 12th ACM Symp. Principles of Programming Languages, Las Vegas, 1980, pp. 163-173.
24. F. Gécseg, and M. Steiby Tree Automata 1984 Akadémiai Kiadó Budapest
25. F. Gécseg, and M. Steiby Tree languages G. Rozenberg A. Salomaa Handbook of Formal Languages Vol. 3 1997 Springer Berlin 1 68
26. G. Grätzer Universal Algebra 1979 Springer Berlin
27. U. Heuter, First-order properties of trees, star-free expressions, and aperiodicity, in: R. Cori, M, Wirsing (Eds.), STACS 88, Lecture Notes in Computer Science, Vol. 294, Springer, Berlin, 1988, pp. 136-148.
28. J.A. Kamp, Tense logic and the theory of linear order, Ph.D. Thesis, UCLA, 1968.
29. S. MacLane Categories for the Working Mathematician 1971 Springer Berlin
30. R. McNaughton, and S. Papert Counter-Free Automata 1971 MIT Press Cambridge, MA
31. J. Mezei, and J.B. Wright Algebraic automata and context-free sets Inform. and Control 11 1967 3 29
32. J.-E. Pin Variétés de langages formels 1984 Masson Paris (English translation: Varieties of formal languages, Plenum, New York, 1986)
33. A. Potthoff, Modulo counting quantifiers over finite trees, in: J.-C. Raoult (Ed.), CAAP '92, Lecture Notes in Computer Science, Vol. 581, Springer, Berlin, 1992, pp. 265-278.
34. A. Potthoff, First order logic on finite trees, in: P.D. Mosses, M. Nielsen, M.I. Schwartzbach (Eds.), TAPSOFT '95, Lecture Notes in Computer Science, Vol. 915, Springer, Berlin, 1995, pp. 125-139.
35. M.P. Schützenberger On finite monoids having only trivial subgroups Inform. and Control 8 1965 190 194
36. M. Steinby A theory of tree language varieties M. Nivat A. Podelski Tree Automata and Languages 1992 North-Holland Amsterdam 57 81
37. M. Steinby General varieties of tree languages Theoret. Comput. Sci. 205 1998 1 43
38. H. Straubing Finite Automata, Formal Logic, and Circuit Complexity 1994 Birkhaüser Boston, MA
39. J.W. Thatcher, and J.B. Wright Generalized finite automata theory with an application to a decision problem of second-order logic Math. Systems Theory 2 1968 57 81
40. W. Wechler Universal algebra EATCS Monographs on Theoretical Computer Science Vol. 10 1992 Springer Berlin
41. P. Weil, Algebraic recognizability of languages, in: J. Fiala, V. Koubek, J. Kratochvíl (Eds.), MFCS 2004, Lecture Notes in Computer Science, Vol. 3153, Springer, Berlin, 2004, pp. 149-175.
42. Th. Wilke An algebraic characterization of frontier testable tree languages Theoret. Comput. Sci. 154 1996 85 106