Deciding the weak definability of Büchi definable tree languages

Authors Thomas Colcombet, Denis Kuperberg, Christof Löding, Michael Vanden Boom



PDF
Thumbnail PDF

File

LIPIcs.CSL.2013.215.pdf
  • Filesize: 0.51 MB
  • 16 pages

Document Identifiers

Author Details

Thomas Colcombet
Denis Kuperberg
Christof Löding
Michael Vanden Boom

Cite AsGet BibTex

Thomas Colcombet, Denis Kuperberg, Christof Löding, and Michael Vanden Boom. Deciding the weak definability of Büchi definable tree languages. In Computer Science Logic 2013 (CSL 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 23, pp. 215-230, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
https://doi.org/10.4230/LIPIcs.CSL.2013.215

Abstract

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.
Keywords
  • Tree automata
  • weak definability
  • decidability
  • cost automata
  • boundedness

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail