Closure properties and decision problems of dag automata.
Siva AnantharamanPaliath NarendranMichaël RusinowitchPublished in: Inf. Process. Lett. (2005)
Keyphrases
- decision problems
- closure properties
- tree automata
- directed acyclic graph
- expressive power
- finite automata
- finite state
- optimal policy
- influence diagrams
- regular expressions
- regular languages
- context free grammars
- context free
- computational complexity
- decision model
- utility function
- np hard
- markov decision processes
- structural properties
- multiple criteria
- bandit problems
- bayesian decision problems
- multicriteria decision
- conjunctive queries
- query language
- context sensitive
- probabilistic model
- dynamic programming
- relational databases
- expert systems