Intractability of decision problems for finite-memory automata.
Hiroshi SakamotoDaisuke IkedaPublished in: Theor. Comput. Sci. (2000)
Keyphrases
- decision problems
- finite automata
- regular languages
- influence diagrams
- decision model
- optimal policy
- utility function
- np hard
- np complete
- multiple criteria
- computational complexity
- decision processes
- partially observable
- memory requirements
- optimal strategy
- regular expressions
- sequential decision making
- bandit problems
- bayesian decision problems
- multicriteria decision
- finite state machines
- finite state
- machine learning