Regular tree languages definable in FO

Lecture Notes in Computer Science

Volumn 3404, Issue , 2005, Pages 327-339

  Benedikt, Michael ^a   Segoufin, Luc ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b INRIA   (France)

Author keywords

Logic; Tree automata

Indexed keywords

ALGEBRA; DECISION THEORY; FORMAL LOGIC; GRAPHIC METHODS; TREES (MATHEMATICS);

FIRST ORDER LOGIC; LABELED GRAPHS; POLYNOMIAL TIME; REGULAR TREE LANGUAGES;

FORMAL LANGUAGES;

EID: 20344371054     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31856-9_27     Document Type: Conference Paper

References (19)

1. [BP89] D. Beauquier and J-E. Pin. Factors of words. In Proc. of Intl. Coll. on Automata, Languages and Programming, pages 63-79, 1989.
2. [BW04] M. Bojanczyk and I. Walukiewicz Characterizing EF and EX tree logics. In CONCUR, pages 131-145, 2004.
3. [Bc60] J. Bchi. Weak second-order logic and finite automata. S. Math. Logik Grunlagen Math., 6:66-92, 1960.
4. [CH91] S. Cho and D T. Huynh. Finite-automaton aperiodicity is PSPACE-complete. Theoretical Computer Science, 88(1):99-116, 1991.
5. [CPP93] J. Cohen, D. Perrin, and J-E. Pin. On the expressive power of temporal logic for finite words. Journal of Computer and Science Systems, 46(1993):271-294, 1993.
6. [Don70] J. Doner. Tree acceptors and some of their applications. Journal of Computer and System Sciences, 4:406-451, 1970.
7. [EW03] Z. Ésik and P. Weil. On logically defined recognizable tree languages. In FSTTCS, pages 195-207, 2003.
8. [Heu91] U. Heuter. First-order properties of trees, star-free expressions, and aperiodicity. Informatique Thorique et Applications, 25:125-146, 1991.
9. [Lib04] L. Libkin. Elements of finite model theory. Springer, 2004.
10. [MP71] R. McNaughton and S. Papert. Counter-free Automata. MIT Press, 1971.
11. [Pin96] J-E. Pin. The expressive power of existential first order sentences of Bchi's sequential calculus. In Proc. of Intl. Coll. on Automata, Languages and Programming, pages 300-311, 1996.
12. [Pot95] A. Potthoff. First-order logic on finite trees. In Theory and Practice of Software Development (TAPSOFT), pages 125-139, 1995.
13. [PT93] A. Potthoff and W. Thomas. Regular tree languages without unary symbols are star-free. In Fundamentals of Computation Theory (FCT), pages 396-405, 1993.
14. [Sch65] M. P. Schtzenberger. On finite monoids having only trivial subgroups. Information and Control, 8:190-194, 1965.
15. [Str94] H. Straubing. Finite Automata, Formal Logic, and Circuit Complexity. Birkhuser, 1994.
16. [Tho97] W. Thomas. Handbook of Formal Languages, volume 3, chapter 7. Springer, 1997.
17. [TW68] J.W. Thatcher and J.B. Wright. Generalized finite automata with an application to a decision problem of second order logic. Math. Syst. Theory, 2:57-82, 1968.
18. [TW85] D. Thérien and A. Weiss. Graph congruences and wreath products J. Pure and Applied Algebra, 36:205-215, 1985.
19. [Wil96] T. Wilke. An algebraic characterization of frontier testable tree languages. Theoretical Computer Science, 154(1):85-106, 1996.