Decision Problems for Probabilistic Finite Automata on Bounded Languages.
Paul C. BellVesa HalavaMika HirvensaloPublished in: Fundam. Informaticae (2013)
Keyphrases
- finite automata
- decision problems
- regular languages
- grammatical inference
- influence diagrams
- regular expressions
- deterministic automata
- utility function
- decision model
- tree automata
- bayesian networks
- bounded treewidth
- probabilistic model
- optimal policy
- computational complexity
- decision theory
- finite automaton
- bayesian decision problems
- pattern matching
- context free grammars
- np hard
- query language
- context free
- hidden markov models
- databases
- inductive inference
- special case