A polynomial time algorithm for the local testability problem of deterministic finite automata

  • Sam Kim
  • Robert McNaughton
  • Robert McCloskey
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 382)


We investigate the local testability problem of deterministic finite automata. A locally testable language is a language with the property that for some positive integer k, whether or not a word w is in the language depends on (1) the prefix and suffix of w of length k, and (2) the set of intermediate substrings of w of length k+1, without regard to the order in which these substrings occur. The local testability problem is, given a deterministic finite automaton, to decide whether it accepts a locally testable language or not. No polynomial time algorithm for this problem has appeared in the literature. We present an O(n2) time algorithm for the local testability problem based on two simple properties that characterize locally testable automata.


Polynomial Time Algorithm Finite Automaton Transition Graph Testable Language Finite State Automaton 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. (1).
    Aho, A., Hopcroft, J., and Ullman, J., The Design and Analysis of Computer Algorithms, Addison-Wesley (1974).Google Scholar
  2. (2).
    Brzozowski, J. and Simon, I., Characterizations of locally testable events, Discrete Mathematics 4 (1973), pp. 243–271.CrossRefGoogle Scholar
  3. (3).
    Hopcroft, J., and Ullman, J., Introduction to Automata Theory, Languages, and Computation, Addison Weslely (1979).Google Scholar
  4. (4).
    Hunt, H. and Rosenkrantz, D., Computational parallels between the regular and context-free languages, SIAM J. COMPUT., 7 (1978), pp. 99–114.CrossRefGoogle Scholar
  5. (5).
    Liu, C., k-th Order Finite Automaton, IEEE Trans. EC-13, (1964), pp. 738–740.Google Scholar
  6. (6).
    Martin, R., Studies in Feedback-Shift-Register Synthesis of Sequential Machines, M.I.T. Press, (1969).Google Scholar
  7. (7).
    McNaughton, R., Algebraic decision procedures for local testability, Mathematical Systems Theory, Vol.8 (1974), pp. 60–76.CrossRefGoogle Scholar
  8. (8).
    McNaughton, R. and Papert, S., Counter-free Automata, M.I.T. Press, (1971)Google Scholar
  9. (9).
    Menon, P., and Friedman, A., Fault detection in iterative logic arrays, IEEE Trans. on Computers, C-20 (1971), pp. 524–535.Google Scholar
  10. (10).
    Stern, J., Characterizations of some classes of regular events, Theoretical Computer Science, 35 (1985), pp. 17–42.Google Scholar
  11. (11).
    Stern, J., Complexity of some problems from the theory of automata, Information and control, 66 (1985), pp. 163–176.Google Scholar
  12. (12).
    Zalcstein, Y., Locally testable languages, Journal of Computer and System Sciences, 6 (1972), pp. 151–167.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Sam Kim
    • 1
  • Robert McNaughton
    • 1
  • Robert McCloskey
    • 1
  1. 1.Computer Science DepartmentRensselaer Polytechnic InstituteTroy

Personalised recommendations