A Polynomial Time Algorithm for the Local Testability Problem of Deterministic Finite Automata

Sam M. Kim, Robert McNaughton, Robert McCloskey. A Polynomial Time Algorithm for the Local Testability Problem of Deterministic Finite Automata. In Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Nicola Santoro, editors, Algorithms and Data Structures, Workshop WADS 89, Ottawa, Canada, August 17-19, 1989, Proceedings. Volume 382 of Lecture Notes in Computer Science, pages 420-436, Springer, 1989.

Abstract

Abstract is missing.