Parameterized complexity of basic decision problems for tree automata.
Witold CharatonikAgata ChorowskaPublished in: Int. J. Comput. Math. (2013)
Keyphrases
- decision problems
- tree automata
- parameterized complexity
- bounded treewidth
- fixed parameter tractable
- finite state
- np hard
- regular expressions
- finite automata
- influence diagrams
- optimal policy
- global constraints
- utility function
- computational complexity
- context free
- learning algorithm
- search algorithm
- markov decision processes
- pattern matching
- np complete
- markov chain
- query language