Login / Signup

Deciding the weak definability of Büchi definable tree languages.

Thomas ColcombetDenis KuperbergChristof LödingMichael Vanden Boom
Published in: CSL (2013)
Keyphrases
  • tree languages
  • tree automata
  • monadic second order logic
  • regular expressions
  • finite state
  • context free
  • finite automata
  • positive data
  • pattern matching
  • tree patterns
  • rooted trees