Abstract
The present paper uses a game theoretic approach to make a fine study of the monadic theory of the infinite binary tree. We characterize some natural classes of monadic formulas in terms of alternating automata; in particular we give a hierarchy of automata corresponding to the hierarchy of alternation of quantifiers for weak monadic formulas. These characterizations lead to efficient decision procedures.
Cite
CITATION STYLE
Parigot, M. (1987). Automata, games, and positive monadic theories of trees. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 287 LNCS, pp. 44–57). Springer Verlag. https://doi.org/10.1007/3-540-18625-5_41
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
