Arbitrary-arity Tree Automata and QCTL

François Laroussinie, Nicolas Markey

We introduce a new class of automata (which we coin EU-automata) running on infininte trees of arbitrary (finite) arity. We develop and study several algorithms to perform classica…