Relating Hierarchies of Word and Tree Automata

For an ω-word language L, the derived tree language Path(L) is the language of trees having all their paths in L. We consider the hierarchies of deterministic automata on words and nondeterministic automata on trees with Rabin conditions in chain form. We show that L is on some level of the hierarchy of deterministic word automata iff Path(L) is on the same level of the hierarchy of nondeterministic tree automata.

[1]  Andrzej Wlodzimierz Mostowski.  Hierarchies of Weak Automata and Weak Monadic Formulas , 1991, Theor. Comput. Sci..

[2]  A. Prasad Sistla,et al.  On Model-Checking for Fragments of µ-Calculus , 1993, CAV.

[3]  Klaus W. Wagner,et al.  On omega-Regular Sets , 1979, Inf. Control..

[4]  E. Allen Emerson,et al.  The Complexity of Tree Automata and Logics of Programs , 1999, SIAM J. Comput..

[5]  Igor Walukiewicz,et al.  Automata for the Modal mu-Calculus and related Results , 1995, MFCS.

[6]  Andrzej Wlodzimierz Mostowski,et al.  Regular expressions for infinite trees and a standard form of automata , 1984, Symposium on Computation Theory.

[7]  Thomas Wilke,et al.  Computing the Rabin Index of a Regular Language of Infinite Words , 1996, Inf. Comput..

[8]  Orna Kupferman,et al.  Relating word and tree automata , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[9]  Igor Walukiewicz,et al.  Automata for the-calculus and Related Results , 1995 .

[10]  M. Rabin.  Weakly Definable Relations and Special Automata , 1970 .

[11]  Damian Niwinski.  On Fixed-Point Clones (Extended Abstract) , 1986, ICALP.

[12]  E. Allen Emerson,et al.  Tree automata, mu-calculus and determinacy , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[13]  Robert K. Brayton,et al.  Structural Complexity of Omega-Automata , 1995, STACS.

[14]  Klaus W. Wagner.  Eine topologische Charakterisierung einiger Klassen regulärer Folgenmengen , 1977, J. Inf. Process. Cybern..

[15]  David Janin,et al.  Automata for the mu-calculus and Related Results , 1995 .

[16]  Damian Niwinski,et al.  Fixed points vs. infinite generation , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[17]  Ludwig Staiger,et al.  Ω-languages , 1997 .

[18]  Damian Niwinski,et al.  Fixed Point Characterization of Infinite Behavior of Finite-State Systems , 1997, Theor. Comput. Sci..

[19]  Wolfgang Thomas,et al.  Automata on Infinite Objects , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[20]  Wolfgang Thomas,et al.  Languages, Automata, and Logic , 1997, Handbook of Formal Languages.