Arbitrary-arity Tree Automata for QCTL 1
A new class of automata running on infinite trees of arbitrary arity is introduced, and several algorithms to perform classical operations are developed for those automata and precisely characterise their complexities.
François Laroussinie, Nicolas Markey
· 0 citations