A Polynomial Time Algorithm for the Local Testability Problem of Deterministic Finite Automata.
Sam M. KimRobert McNaughtonRobert McCloskeyPublished in: WADS (1989)
Keyphrases
- deterministic finite automata
- matching algorithm
- computational complexity
- experimental evaluation
- worst case
- learning algorithm
- dynamic programming
- objective function
- recognition algorithm
- detection algorithm
- probabilistic model
- preprocessing
- computational cost
- search space
- times faster
- databases
- k means
- optimal solution
- high accuracy
- expectation maximization
- optimization algorithm
- similarity measure
- significant improvement
- particle swarm optimization
- lower bound