Deciding low levels of tree-automata hierarchy

Electronic Notes in Theoretical Computer Science

Volumn 67, Issue , 2002, Pages 61-75

  Walukiewicz, Igor ^a  

^a UNIVERSITÉ DE BORDEAUX   (France)

Author keywords

Finite automata; Fixpoint; Mu calculus; Quantifier hierarchy

Indexed keywords

COMPUTATIONAL COMPLEXITY; DECISION THEORY; FORMAL LANGUAGES; FORMAL LOGIC; MATHEMATICAL MODELS; THEOREM PROVING; TREES (MATHEMATICS);

FIXPOINT; MU-CALCULUS; QUANTIFIER HIERARCHY; SECOND-ORDER LOGIC;

FINITE AUTOMATA;

EID: 4544251183     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)80541-3     Document Type: Conference Paper

References (20)

1. Arnold A. The mu-calculus alternation-depth hierarchy is strict on binary trees. RAIRO-Theoretical Informatics and Applications. 33:1999;329-339
2. Arnold A., Niwiński D. Fixed point characterisation of weak monadic logic definable sets of trees. Nivat M., Podelski A. Tree Automata and Languages. 159-188:1992;Elsevier
3. Arnold A., Niwiski D. "The Rudiments of the Mu-Calculus," Studies in Logic 146. 2001;North-Holand
4. Bradfield J. The modal mu-calculus alternation hierarchy is strict. Theoretical Computer Science. 195:1997;133-153
5. Bradfield J. Fixpoint alternation: Arithmetic, transition systems, and the binary tree. RAIRO-Theoretical Informatics and Applications. 33:1999;341-356
6. Carton O., Maceiras R. Computing the rabin index of a parity automaton. RAIRO-Theoretical Informatics and Applications. 33:1999;495-505
7. Emerson E.A., Jutla C., Sistla A. On model-checking for fragments of μ-calculus. CAV'93, LNCS. 697:1993;385-396
8. Muller D., Schupp P. Alternating automata on infinite trees. Theoretical Computer Science. 54:1987;267-276
9. Niwiński D., On fixed-point clones, in: Proc. 13th ICALP, LNCS 226, 1986, pp. 464-473.
10. Niwiński D. Fixed point characterization of infinite behaviour of finite state systems. Theoretical Computer Science. 189:1997;1-69
11. Niwiński D. and I. Walukiewicz, Relating hierarchies of word and tree automata, in: STACS'98, LNCS 1373 (1998).
12. Niwiński D. and I. Walukiewicz, A gap property of deterministic tree languages (2002), to appear in TCS.
13. Otto M. Eliminating recursion in the mu-calculus. STACS'99, LNCS. 1563:1999;531-540
14. Park D., Concurrency and automata on inifinte sequences, in: 5th Gi Conference on Theoretical Computer Science, LNCS 104, 1981, pp. 167-183.
15. Rabin M. Decidability of second-order theories and automata on infinite trees. Trans. Amer. Math. Soc. 141:1969;1-35
16. Rabin M. Weakly definable relations and special automata. Bar-Hillel Y. Mathematical Logic in Foundations of Set Theory. 1970;1-23
17. Seidl H. Deciding equivalence of finite tree automata. SIAM Journal of Computing. 19:1990;424-437
18. Urba'nski T., On deciding if deterministic rabin language is in büchi class, in: ICALP'00, LNCS, 2000, to appear.
19. Wagner K. Eine topologische Charakterisierung einiger Klassen regulärer Folgenmengen. J. Inf. Process. Cybern. EIK. 13:1977;473-487
20. Wilke T., Yoo H. Computing the Rabin index of a regular language of infinite words. Information and Computation. 130:1996;61-70