Tree Automata, Tree Decomposition and Hyperedge Replacement.
Clemens LautemannPublished in: Graph-Grammars and Their Application to Computer Science (1990)
Keyphrases
- tree decomposition
- tree automata
- tree width
- constraint networks
- regular expressions
- finite automata
- decomposition method
- probabilistic reasoning
- finite state
- branch and bound
- graph theory
- parallel processing
- answer set programming
- tree languages
- constraint satisfaction problems
- finite automaton
- decomposition methods
- context free grammars
- lower bound
- bayesian networks
- databases
- model checking
- state space
- data model
- search algorithm