An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton.
Markus HolzerAndreas MalettiPublished in: CIAA (2009)
Keyphrases
- learning algorithm
- experimental evaluation
- finite state automaton
- recognition algorithm
- cost function
- computational complexity
- times faster
- theoretical analysis
- worst case
- high accuracy
- deterministic finite automata
- improved algorithm
- matching algorithm
- np hard
- probabilistic model
- significant improvement
- k means
- objective function
- simulated annealing
- computationally efficient
- similarity measure
- preprocessing
- finite state automata
- deterministic finite automaton
- feature selection
- finite automaton
- optimal solution
- path planning
- expectation maximization
- particle swarm optimization
- data sets