A Polynomial Time Algorithm for the Local Testability Problem of Deterministic Finite Automata.
Sam M. KimRobert McNaughtonRobert McCloskeyPublished in: IEEE Trans. Computers (1991)
Keyphrases
- computational complexity
- optimization algorithm
- np hard
- detection algorithm
- deterministic finite automata
- objective function
- cost function
- worst case
- learning algorithm
- preprocessing
- optimal solution
- high accuracy
- special case
- approximation ratio
- matching algorithm
- neural network
- polynomial time complexity
- object oriented
- dynamic programming
- k means
- databases
- expectation maximization
- experimental evaluation
- times faster
- convergence rate
- recognition algorithm
- search space
- similarity measure