Sign in
An algorithm for calculating indistinguishable states and clusters in finite-state automata with partially observable transitions.
Weilin Wang
Stéphane Lafortune
Feng Lin
Published in:
Syst. Control. Lett. (2007)
Keyphrases
</>
finite state automata
computational complexity
optimal solution
dynamic programming
belief state
k means
partially observable
objective function
search space
linear programming
matching algorithm
noisy data
search strategy
finite state machines