From generic partition refinement to weighted tree automata minimization.
Thorsten WißmannHans-Peter DeifelStefan MiliusLutz SchröderPublished in: Formal Aspects Comput. (2021)
Keyphrases
- tree automata
- regular expressions
- finite state
- finite automata
- syntactic pattern recognition
- domain specific
- finite automaton
- tree languages
- dynamic programming
- context free grammars
- monadic second order logic
- databases
- context free
- pattern matching
- building blocks
- low level
- domain knowledge
- learning algorithm
- machine learning