The Average Complexity of Moore's State Minimization Algorithm Is O(n log log n).
Julien DavidPublished in: MFCS (2010)
Keyphrases
- worst case
- computational complexity
- space complexity
- learning algorithm
- recognition algorithm
- experimental evaluation
- computational cost
- matching algorithm
- theoretical analysis
- state space
- dynamic programming
- times faster
- standard deviation
- objective function
- similarity measure
- detection algorithm
- improved algorithm
- log log
- memory requirements
- high computational complexity
- complexity analysis
- path length
- linear complexity
- input data
- state variables
- linear programming
- simulated annealing
- high accuracy
- np hard
- k means
- decision trees