On the Existence of the Minimum Asynchronous Automaton and on Decision Problems for Unambiguous Regular Trace Languages.
Danilo BruschiGiovanni PighizziniNicoletta SabadiniPublished in: STACS (1988)
Keyphrases
- decision problems
- regular languages
- finite state automata
- influence diagrams
- finite automata
- decision model
- context free
- optimal strategy
- computational complexity
- optimal policy
- decision processes
- utility function
- np hard
- multiple criteria
- finite state machines
- expressive power
- partially observable
- tree automata
- grammatical inference
- sequential decision making
- bayesian decision problems
- bandit problems
- regular expressions
- graphical models
- functional programming
- state space
- special case