论文信息 - Hierarchies of Weak Automata and Weak Monadic Formulas

Hierarchies of Weak Automata and Weak Monadic Formulas

The paper deals with alternating finite automata (a.f.a.) on trees. Rabin indices and Muller indices for automata, which are well known in relevant literature, are a natural measure of complexity of the automata. Muller index (or Rabin index) of a set of trees is a minimal index of a Muller (or Rabin) automaton which represents this set. In this paper it is proved that both indices, Rabin and Muller, are equal for weak as well as for strong conditions

Andrzej Wlodzimierz Mostowski

[1] David E. Muller,et al. Alternating Automata on Infinite Trees , 1987, Theor. Comput. Sci..

[2] Dirk Siefkes. Review: Michael O. Rabin, Decidability and Definability in Second-Order Theories , 1975 .

[3] J. Richard Büchi,et al. The monadic second order theory of ω1 , 1973 .

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

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

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

[7] E. Muller David,et al. Alternating automata on infinite trees , 1987 .

[8] Yuri Gurevich,et al. Trees, automata, and games , 1982, STOC '82.

[9] Wolfgang Thomas. A hierarchy of sets of infinite trees , 1983, Theoretical Computer Science.

[10] David E. Muller,et al. Alternating Automata. The Weak Monadic Theory of the Tree, and its Complexity , 1986, ICALP.

[11] Wolfgang Thomas,et al. A hierarchy of sets of infinite trees , 1983 .