Treewidth, pathwidth and cospan decompositions with applications to graph-accepting tree automata.
Christoph BlumeH. J. Sander BrugginkMartin FriedrichBarbara KönigPublished in: J. Vis. Lang. Comput. (2013)
Keyphrases
- bounded treewidth
- tree automata
- np complete
- regular expressions
- boolean functions
- decision problems
- finite state
- tree languages
- graph structure
- syntactic pattern recognition
- finite automata
- relational learning
- databases
- conjunctive queries
- context free
- np hard
- constraint graph
- search space
- finite automaton
- expert systems
- pattern matching
- object oriented
- dynamic programming