Finite-State Computability of Annotations of Strings and Trees.
Hans L. BodlaenderMichael R. FellowsPatricia A. EvansPublished in: CPM (1996)
Keyphrases
- finite state
- tree automata
- markov chain
- markov decision processes
- model checking
- tree structures
- decision trees
- optimal policy
- finite automata
- edit distance
- context free
- partially observable markov decision processes
- action sets
- finite state transducers
- stochastic processes
- distance function
- state space
- search space