A combinatorial algorithm for minimizing the number of states of a deterministic finite automation.
Nicholas J. DeLilloPublished in: ACM Conference on Computer Science (1989)
Keyphrases
- computational complexity
- experimental evaluation
- high accuracy
- worst case
- learning algorithm
- space complexity
- np hard
- detection algorithm
- theoretical analysis
- execution times
- times faster
- cost function
- matching algorithm
- particle swarm optimization
- neural network
- memory requirements
- deterministic finite automata
- small number
- computational cost
- k means
- optimal solution
- objective function
- similarity measure
- data sets
- simulated annealing
- linear programming
- computationally efficient
- segmentation algorithm
- dynamic programming
- preprocessing
- relaxation algorithm
- polynomial time complexity