Relating hierarchies of word and tree automata

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

Volumn 1373 LNCS, Issue , 1998, Pages 320-331

  Niwiński, Damian ^a   Walukiewicz, Igor ^a  

^a UNIVERSITY OF WARSAW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

DETERMINISTIC AUTOMATA; NONDETERMINISTIC AUTOMATA; TREE AUTOMATA; TREE LANGUAGES; WORD AUTOMATA; WORD LANGUAGES;

COMPUTER SCIENCE;

AUTOMATA THEORY;

EID: 78649885483     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0028571     Document Type: Conference Paper

References (17)

1. E. A. Emerson, C. Jutla, and A. Sistla. On model-checking for fragments of μ-calculus. In CAV'93, volume 697 of LNCS, pages 385-396, 1993.
2. E. A. Emerson and C. S. Jutla. The complexity of tree automata and logics of programs. In 29th FOCS, 1988.
3. E. A. Emerson and C. S. Jutla. Tree automata, mu-calculus and determinacy. In Proc. FOCS 91, 1991.
4. D. Janin and I. Walukiewicz. Automata for the μ-calculus and related results. In MFCS '95, volume 969 of LNCS, pages 552-562, 1995.
5. S. Krishnan, A. Puri, and R. Brayton. Srtuctural complexity of ω-automata. In STACS'95, volume 900 of LNCS, 1995.
6. O. Kupferman, S. Safra, and M. Vardi. Relating word and tree automata. In 11th IEEE Symp. on Logic in Comput. Sci., pages 322-332, 1996.
7. A. W. Mostowski. Regular expressions for infinite trees and a standard form of automata. In A. Skowron, editor, Fifth Symposium on Computation Theory, volume 208 of LNCS, pages 157-168, 1984.
8. A. W. Mostowski. Hierarchies of weak automata and week monadic formulas. Theoretical Computer Science, 83:323-335, 1991.
9. D. Niwiński. On fixed-point clones. In Proc. 13th ICALP, volume 226 of LNCS, pages 464-473, 1986.
10. D. Niwiński. Fixed points vs. infinite generation. In LICS '88, pages 402-409, 1988.
11. D. Niwiński. Fixed point characterization of infinite behaviour of finite state systems. Theoretical Computer Science, 1998. to appear.
12. M. Rabin. Weakly definable relations and special automata. In Y.Bar-Hillel, editor, Mathematical Logic in Foundations of Set Theory, pages 1-23. 1970.
13. W. Thomas. Automata on infinite objects. In J. van Leeuven, editor, Handbook of Theoretical Computer Science Vol.B, pages 133-192. Elsevier, 1990.
14. W. Thomas. Languages, automata, and logic. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume 3. Springer-Verlag, 1997.
15. K. Wagner. Eine topologische Charakterisierung einiger Klassen reguläirer Folgenmengen. J. Inf. Process. Cybern. EIK, 13:473-487, 1977.
16. K. Wagner. On ω-regular sets. Information and Control, 43:123-177, 1979.
17. T. Wilke and H. Yoo. Computing the Rabin index of a regular language of infinite words. Information and Computation, 130(1):61-70, 1996.