An nlogn algorithm for hyper-minimizing a (minimized) deterministic automaton.
Markus HolzerAndreas MalettiPublished in: Theor. Comput. Sci. (2010)
Keyphrases
- dynamic programming
- high accuracy
- experimental evaluation
- computational complexity
- detection algorithm
- computationally efficient
- improved algorithm
- np hard
- input data
- worst case
- preprocessing
- learning algorithm
- optimization algorithm
- motion estimation
- k means
- optimal solution
- ant colony optimization
- times faster
- relaxation algorithm
- deterministic finite automata
- data sets
- finite state automaton
- expectation maximization
- simulated annealing
- computational cost
- cost function
- significant improvement
- data structure
- objective function
- reinforcement learning
- similarity measure