An upper bound on the order of locally testable deterministic finite automata
- 155 Downloads
A locally testable language is a language with the property that for some nonnegative integer k, called the order of locality, 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. Recently, we introduced the first polynomial time algorithm for the local testability problem based on a simple characterization of locally testable deterministic automata. This paper investigates the upper bound on the order of locally testable automata. It shows that the order of a locally testable deterministic automaton is at most n4 + 1, where n is the number of states of the automaton.
KeywordsPolynomial Time Algorithm Finite Automaton Transition Graph Closed Path Testable Language
Unable to display preview. Download preview PDF.
- (1).Aho, A., Hopcroft, J., and Ullman, J., The Design and Analysis of Computer Algorithms, Addison-Wesley (1974).Google Scholar
- (3).Harrison, M., Introduction to Formal Language Theory, Addison Wesley (1978).Google Scholar
- (4).Hopcroft, J., and Ullman, J., Introduction to Automata Theory, Languages, and Computation, Addison Weslely (1979).Google Scholar
- (6).Kim, S., McNaughton, R., and McCloskey, R., A polynomial time algorithm for the local testability problem of deterministic finite automata, Workshop on Algorithms and Data Structures, (1989).Google Scholar
- (7).Martin, R., Studies in Feedback-Shift-Register Synthesis of Sequential Machines, M.I.T. Press, (1969).Google Scholar
- (9).McNaughton, R. and Papert, S., Counter-free Automata, M.I.T. Press, (1971)Google Scholar
- (10).Menon, P., and Friedman, A., Fault detection in iterative logic arrays, IEEE Trans. on Computers, C-20 (1971), pp. 524–535.Google Scholar
- (11).Zalcstein, Y., Locally testable languages, Journal of Computer and System Sciences, 6 (1972), pp. 151–167.Google Scholar