Generalized automata on infinite trees and Muller-McNaughton's Theorem

Decidability of Second-order Theories and Automata on Infinite Trees

Complementation and Inclusion of Weighted Automata on Infinite Trees

Weighted automata can be seen as a natural generalization of finite state automata to more complex algebraic structures. The standard reasoning tasks for unweighted automata can also be generalized to the weighted setting. In this report we study the problems of intersection, complementation and inclusion for weighted automata on infinite trees and show that they are not harder than reasoning w...

Deciding Emptiness for Stack Automata on Infinite Trees

The Emptiness Problem for Automata on Infinite Trees

The purpose of this paper is to give an alternative proof to the decidability of the emptiness problem for tree automata, as shown in Rabin [4]. The proof reduces the emptiness problem for automata on infinite trees to that for automata on finite trees, by showing that any automata definable set of infinite trees must contain a finitelygenerable tree. Section 1: Introduction The analysis of fin...

The Inclusion Problem for Weighted Automata on Infinite Trees

Weighted automata can be seen as a natural generalization of finite state automata to more complex algebraic structures. The standard reasoning tasks for unweighted automata can also be generalized to the weighted setting. In this paper we study the problems of intersection, complementation and inclusion for weighted automata on infinite trees and show that they are not harder complexity-wise t...