An Efficient Algorithm for Constructing Minimal Cover Automata for Finite Languages.
Cezar CâmpeanuAndrei PaunSheng YuPublished in: Int. J. Found. Comput. Sci. (2002)
Keyphrases
- learning algorithm
- computational cost
- experimental evaluation
- times faster
- computationally efficient
- optimal solution
- theoretical analysis
- significant improvement
- high accuracy
- similarity measure
- language independent
- simulated annealing
- worst case
- dynamic programming
- np hard
- cost function
- particle swarm optimization
- preprocessing
- computational complexity
- optimization algorithm
- pattern matching
- cellular automata
- objective function
- improved algorithm
- bayesian networks
- finite state automata