Complexity of weak acceptance conditions in tree automata

Information Processing Letters

Volumn 84, Issue 4, 2002, Pages 181-187

  Neumann, Jakub ^a   Szepietowski, Andrzej ^a   Walukiewicz, Igor ^b  

^a UNIVERSITY OF GDA SK   (Poland)

^b UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

Computational complexity; Emptiness problem; Formal languages; Tree automata; Weak conditions

Indexed keywords

COMPUTATIONAL COMPLEXITY; FORMAL LANGUAGES; MATHEMATICAL MODELS; PROBLEM SOLVING; TREES (MATHEMATICS);

INFINITE SEQUENCES;

DATA PROCESSING;

EID: 0037202496     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(02)00285-5     Document Type: Article

References (13)

1. Emerson E.A. Automata, tableaux, and temporal logics. Workshop on Logics of Programs. 1985;79-87.
2. Emerson E.A., Jutla C.S. The complexity of tree automata and logics of programs. 29th IEEE Symposium on Foundations of Computer Science. 1988;368-377.
3. Immerman N. Number of quantifiers is better than number of tape cells. J. Comput. System Sci. 22:1981;384-406.
4. Klarlund N. Progress measures, immediate determinacy and a subset construction for tree automata. LICS'92. 1992;382-393.
5. Kupferman O., Vardi M.Y., Wolper P. An automata-theoretic approach to branching-time model checking. J. ACM. 47:(2):2000;312-360.
6. Wagner K., Staiger L. Automatentheoretische und automatenfreie charakterisierungen topologischer klassen regulärer folgenmengen. EIK. 10:1974;379-392.
7. Mostowski A.W. Hierarchies of weak automata and weak monadic formulas. Theoret. Comput. Sci. 83:1991;323-335.
8. Muller D.E., Saoudi A., Schupp P.E. Alternating automata, the weak monadic theory of the tree and its complexity. Theoret. Comput. Sci. 97:1992;233-244.
9. Skurczyński J. Tree automata with weak acceptance conditions, PhD thesis. 1989;University of Gdańsk.
10. Skurczyński J. A negative result for chain logic, Technical Report. 1997;University of Gdańsk.
11. Miyano S., Hayashi T. Finite tree automata on infinite trees. Bull. Inform. Cybernet. 21:1985;71-82.
12. Thomas W. Automata on infinite objects. van Leeuwen J., Handbook of Theoretical Computer Science. B:1990;133-192 Elsevier, Amsterdam.
13. Thomas W. Languages, automata, and logic. Rozenberg G., Salomaa A., Handbook of Formal Languages. 3:1997;Springer, Berlin.