I n the automata-theoretic approach to verification, we translate specifications to automata. Complexity considerations motivate the distinction between different types of automata. Already in the 60's) it was known that deterministic Biichi word automata are less expressive than nondeterministic Biichi word automata. The proof is easy and can be stated in a few lines. I n the late 60's) Rabin ...

In the paper, we introduce a new tree automata framework, called propositional tree automata, capturing the class of tree languages that are closed under an equational theory and Boolean operations. This framework originates in work on developing a su cient completeness checker for speci cations with rewriting modulo an equational theory. Propositional tree automata recognize regular equational...

In the automata-theoretic approach to verification, we translate specifications to automata. Complexity considerations motivate the distinction between different types of automata. Already in the 60’s, it was known that deterministic Büchi word automata are less expressive than nondeterministic Büchi word automata. The proof is easy and can be stated in a few lines. In the late 60’s, Rabin prov...