On the Average Complexity of Moore's State Minimization Algorithm.
Frédérique BassinoJulien DavidCyril NicaudPublished in: STACS (2009)
Keyphrases
- worst case
- computational complexity
- times faster
- theoretical analysis
- computational cost
- experimental evaluation
- learning algorithm
- objective function
- space complexity
- simulated annealing
- significant improvement
- optimal solution
- dynamic programming
- cost function
- probabilistic model
- clustering method
- detection algorithm
- optimization algorithm
- improved algorithm
- recognition algorithm
- preprocessing
- path planning
- search space
- expectation maximization
- high accuracy
- segmentation algorithm
- linear complexity
- polynomial time complexity
- computationally efficient
- maximum likelihood
- neural network
- np hard