On the Boolean Closure of Deterministic Top-Down Tree Automata.
Christof LödingWolfgang ThomasPublished in: CoRR (2024)
Keyphrases
- tree automata
- closure properties
- regular expressions
- regular tree languages
- finite automata
- finite state
- tree languages
- context free grammars
- boolean functions
- syntactic pattern recognition
- closure operator
- machine learning
- pattern matching
- query processing
- query evaluation
- hidden markov models
- finite automaton
- high level