) Algorithm for Constructing Minimal Cover Automata for Finite Languages.
Andrei PaunNicolae SanteanSheng YuPublished in: CIAA (2000)
Keyphrases
- learning algorithm
- times faster
- preprocessing
- dynamic programming
- significant improvement
- optimal solution
- cost function
- computationally efficient
- search space
- np hard
- experimental evaluation
- computational cost
- convex hull
- detection algorithm
- finite state automata
- objective function
- improved algorithm
- recognition algorithm
- theoretical analysis
- computational complexity
- np complete
- expectation maximization
- optimization algorithm
- particle swarm optimization
- tree structure
- matching algorithm
- expressive power
- linear programming
- simulated annealing
- high accuracy
- mobile robot