On logically defined recognizable tree languages

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

Volumn 2914, Issue , 2003, Pages 195-207

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

^a UNIVERSITY OF SZEGED   (Hungary)

^b UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

[No Author keywords available]

Indexed keywords

FORESTRY; FORMAL LOGIC; SOFTWARE ENGINEERING;

ALGEBRAIC STRUCTURES; EXPRESSIVE POWER; FINITE TREES; FIRST ORDER LOGIC; PRECLONES; PRODUCT OPERATIONS; RECOGNIZABLE TREE LANGUAGES;

ALGEBRA;

LANGUAGES; LOGIC; TREES;

EID: 35248865743     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24597-1_17     Document Type: Article

References (32)

1. J. Almeida, On pseudovarieties, varieties of languages, filters of congruences, pseudoidentities and related topics, Algebra Universalis, 27(1990), 333-350.
2. Arnold and M. Dauchet, Theorie des magmoides. I. and II. (in French), RAIRO Theoretical Informatics and Applications, 12(1978), 235-257,
3. Arnold and M. Dauchet, RAIRO Theoretical Informatics and Applications, 3(1979), 135-154.
4. S. L. Bloom and Z. Ésik, Iteration Theories, Springer, 1993.
5. J. R. Büchi, Weak second-order arithmetic and finite automata, Z. Math. Logik Grundlagen Math., 6(1960), 66-92.
6. J. Cohen, J.-E. Pin and D. Perrin, On the expressive power of temporal logic, J. Computer and System Sciences, 46(1993), 271-294.
7. B. Courcelle, The monadic second-order logic of graphs. I. Recognizable sets of finite graphs, Information and Computation, 85(1990), 12-75.
8. K. Denecke and S. L. Wismath, Universal Algebra and Applications in Theoretical Computer Science, Chapman and Hall, 2002.
9. V. Diekert, Combinatorics on Traces, LNCS 454, Springer, 1987.
10. J. Doner, Tree acceptors and some of their applications, J. Comput. System Sci., 4(1970), 406-451.
11. H.-D. Ebbinghaus and J. Flum, Finite Model Theory, Springer, 1995.
12. S. Eilenberg, Automata, Languages, and Machines, vol. A and B, Academic Press, 1974 and 1976.
13. S. Eilenberg and J. B. Wright, Automata in general algebras. Information and Control, 11(1967), 452-470.
14. C. C. Elgot, Decision problems of finite automata design and related arithmetics, Trans. Amer. Math. Soc., 98(1961), 21-51.
15. Z. Ésik, A variety theorem for trees and theories, Publicationes Mathematicae, 54(1999), 711-762.
16. Z. Ésik and K. G. Larsen, Regular languages definable by Lindström quantifiers, Theoretical Informatics and Applications, to appear.
17. D. M. Gabbay, A. Pnueli, S. Shelah and J. Stavi, On the temporal analysis of fairness, in: proc. 12th ACM Symp. Principles of Programming Languages, Las Vegas, 1980, 163-173.
18. U. Heuter, First-order properties of trees, star-free expressions, and aperiodicity, in: STACS 88, LNCS 294, Springer, 1988, 136-148.
19. J. A. Kamp, Tense logic and the theory of linear order, Ph. D. Thesis, UCLA, 1968.
20. P. Lindström: First order predicate logic with generalized quantifiers. Theoria, 32(1966), 186-195.
21. S. MacLane, Categories for the Working Mathematician, Springer, 1971.
22. R. McNaughton and S. Papert, Counter-Free Automata, MIT Press, 1971.
23. J. Mezei and J. B. Wright, Algebraic automata and context-free sets, Information and Control, 11(1967), 3-29.
24. A. Potthoff, Modulo counting quantifiers over finite trees, in: CAAP '92, LNCS 581, Springer, 1992, 265-278.
25. A. Potthoff, First order logic on finite trees, in: TAPSOFT '95, LNCS 915, Springer, 1995.
26. J. Rhodes and B. Tilson: The kernel of monoid morphisms, J. Pure and Appl. Alg., 62(1989), 227-268.
27. M. P. Schützenberger, On finite monoids having only trivial subgroups. Information and Control, 8(1965), 190-194.
28. M. Steinby, General varieties of tree languages. Theoret. Comput. Sci., 205(1998), 1-43.
29. H. Straubing, Finite Automata, Formal Logic, and Circuit Complexity, Birkhauser Boston, Inc., Boston, MA, 1994.
30. H. Straubing, D. Therien and W. Thomas, Regular languages defined with generalized quantifiers, Information and Computation, 118(1995), 289-301.
31. 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.
32. Th. Wilke, An algebraic characterization of frontier testable tree languages, Theoret. Comput. Sci., 154(1996), 85-106.