Intractability of Decision Problems for Finite-Memory Automata.
Hiroshi SakamotoDaisuke IkedaPublished in: MCU (2) (1998)
Keyphrases
- decision problems
- finite automata
- regular languages
- influence diagrams
- computational complexity
- utility function
- optimal policy
- decision model
- optimal strategy
- multiple criteria
- sequential decision making
- np complete
- partially observable
- memory requirements
- finite state
- decision processes
- multicriteria decision
- bayesian decision problems
- np hard
- main memory
- minimax regret
- bandit problems
- data mining
- tree automata
- memory size
- dynamic programming
- bayesian networks