Theoretical Computer Science
A Polynomial time Algorithm for the Local Testability Problem of Deterministic Finite Automata
IEEE Transactions on Computers
On the bound of the synchronization delay of a local automaton
Theoretical Computer Science
Semigroups and Combinatorial Applications
Semigroups and Combinatorial Applications
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
STACS '89 Proceedings of the 6th Annual Symposium on Theoretical Aspects of Computer Science
Computing the Order of a Locally Testable Automaton
Proceedings of the 11th Conference on Foundations of Software Technology and Theoretical Computer Science
A Precise Estimation of the Order of Local Testability of a Deterministic Finite Automaton
WIA '97 Revised Papers from the Second International Workshop on Implementing Automata
LANGAGE: A Maple Package for Automaton Characterization of Regular Languages
WIA '97 Revised Papers from the Second International Workshop on Implementing Automata
Counter-Free Automata (M.I.T. research monograph no. 65)
Counter-Free Automata (M.I.T. research monograph no. 65)
Journal of Computer and System Sciences
Execution monitoring enforcement under memory-limitation constraints
Information and Computation
Execution monitoring enforcement for limited-memory systems
Proceedings of the 2006 International Conference on Privacy, Security and Trust: Bridge the Gap Between PST Technologies and Business Services
A package TESTAS for checking some kinds of testability
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
| Hi-index | 0.00 |
A locally threshold testable language L is a language with the property that for some nonnegative integers k and l, whether or not a word u is in the language L depends on (1) the prefix and suffix of the word u of length k-1 and (2) the set of intermediate substrings of length k of the word u where the sets of substrings occurring at least j times are the same, for j 驴 l. For given k and l the language is called l-threshold k-testable. A finite deterministic automaton is called l-threshold k-testable if the automaton accepts a l-threshold k-testable language.In this paper, the necessary and sufficient conditions for an automaton to be locally threshold testable are found. We introduce the first polynomial time algorithm to verify local threshold testability of the automaton based on this characterization.New version of polynomial time algorithm to verify the local testability will be presented too.