On the Boolean Closure of Deterministic Top-Down Tree Automata.

Christof Löding Wolfgang Thomas

Published in: Int. J. Found. Comput. Sci. (2024)

Keyphrases

tree automata
closure properties
regular expressions
finite automata
regular tree languages
finite state
syntactic pattern recognition
tree languages
finite automaton
high level
boolean functions
context free grammars
pattern matching
expressive power