1991 |
3 | | Sam M. Kim,
Robert McNaughton,
Robert McCloskey:
A Polynomial Time Algorithm for the Local Testability Problem of Deterministic Finite Automata.
IEEE Trans. Computers 40(10): 1087-1093 (1991) |
1989 |
2 | | Sam M. Kim,
Robert McNaughton,
Robert McCloskey:
An Upper Bound on the Order of Locally Testable Deterministic Finite Automata.
Optimal Algorithms 1989: 48-65 |
1 | | Sam M. Kim,
Robert McNaughton,
Robert McCloskey:
A Polynomial Time Algorithm for the Local Testability Problem of Deterministic Finite Automata.
WADS 1989: 420-436 |