Abstract
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.
Partial support for this research was provided by the Directorate of Computer and Information Science and Engineering of the National Science Foundation under Institutional Infrastructure Grant No. CDA-8805910.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Aho, A., Hopcroft, J., and Ullman, J., The Design and Analysis of Computer Algorithms, Addison-Wesley (1974).
Brzozowski, J. and Simon, I., Characterizations of locally testable events, Discrete Mathematics 4 (1973), pp. 243–271.
Hopcroft, J., and Ullman, J., Introduction to Automata Theory, Languages, and Computation, Addison Weslely (1979).
Hunt, H. and Rosenkrantz, D., Computational parallels between the regular and context-free languages, SIAM J. COMPUT., 7 (1978), pp. 99–114.
Liu, C., k-th Order Finite Automaton, IEEE Trans. EC-13, (1964), pp. 738–740.
Martin, R., Studies in Feedback-Shift-Register Synthesis of Sequential Machines, M.I.T. Press, (1969).
McNaughton, R., Algebraic decision procedures for local testability, Mathematical Systems Theory, Vol.8 (1974), pp. 60–76.
McNaughton, R. and Papert, S., Counter-free Automata, M.I.T. Press, (1971)
Menon, P., and Friedman, A., Fault detection in iterative logic arrays, IEEE Trans. on Computers, C-20 (1971), pp. 524–535.
Stern, J., Characterizations of some classes of regular events, Theoretical Computer Science, 35 (1985), pp. 17–42.
Stern, J., Complexity of some problems from the theory of automata, Information and control, 66 (1985), pp. 163–176.
Zalcstein, Y., Locally testable languages, Journal of Computer and System Sciences, 6 (1972), pp. 151–167.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, S., McNaughton, R., McCloskey, R. (1989). A polynomial time algorithm for the local testability problem of deterministic finite automata. In: Dehne, F., Sack, J.R., Santoro, N. (eds) Algorithms and Data Structures. WADS 1989. Lecture Notes in Computer Science, vol 382. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51542-9_35
Download citation
DOI: https://doi.org/10.1007/3-540-51542-9_35
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51542-5
Online ISBN: 978-3-540-48237-6
eBook Packages: Springer Book Archive