Deciding the weak definability of Büchi definable tree languages
Weakly definable languages of infinite trees are an expressive subclass of regular tree languages definable in terms of weak monadic second-order logic, or equivalently weak alternating automata. Our main result is that given a Büchi automaton, it is decidable whether the language is weakly definable. We also show that given a parity automaton, it is decidable whether the language is recognizable by a nondeterministic co-Büchi automaton.
The decidability proofs build on recent results about cost automata over infinite trees. These automata use counters to define functions from infinite trees to the natural numbers extended with infinity. We reduce to testing whether the functions defined by certain "quasi-weak" cost automata are bounded by a finite value.
Tree automata
weak definability
decidability
cost automata
boundedness
215-230
Regular Paper
Thomas
Colcombet
Thomas Colcombet
Denis
Kuperberg
Denis Kuperberg
Christof
Löding
Christof Löding
Michael
Vanden Boom
Michael Vanden Boom
10.4230/LIPIcs.CSL.2013.215
Creative Commons Attribution 3.0 Unported license
https://creativecommons.org/licenses/by/3.0/legalcode