Finite automata, bounded treewidth, and well-quasiordering.
Karl R. AbrahamsonMichael R. FellowsPublished in: Graph Structure Theory (1991)
Keyphrases
- bounded treewidth
- finite automata
- np complete
- probabilistic automata
- regular expressions
- deterministic automata
- decision problems
- highly parallelizable
- conjunctive queries
- grammatical inference
- boolean functions
- tree automata
- finite automaton
- hidden markov models
- high level
- fixed parameter tractable
- databases
- relational learning
- supervised learning
- query language
- np hard
- relational databases
- monadic datalog