Computational Complexity of Decision Problems on Self-verifying Finite Automata.
Markus HolzerSebastian JakobiJozef Jirásek Jr.Published in: DLT (2018)
Keyphrases
- decision problems
- finite automata
- computational complexity
- influence diagrams
- grammatical inference
- deterministic automata
- regular expressions
- regular languages
- probabilistic automata
- decision processes
- tree automata
- optimal policy
- decision model
- model checking
- finite automaton
- utility function
- multiple criteria
- np hard
- np complete
- bayesian decision problems
- multicriteria decision
- bandit problems
- hidden markov models