A Polynomial time Algorithm for the Local Testability Problem of Deterministic Finite Automata
IEEE Transactions on Computers
Computing the Order of a Locally Testable Automaton
SIAM Journal on Computing
Families of locally testable languages
Theoretical Computer Science
Theoretical Computer Science - Selected papers in honor of Manuel Blum
Locally Threshold Testable Languages in Strict Sense: Application to the Inference Problem
ICGI '98 Proceedings of the 4th International Colloquium on Grammatical Inference
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
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)
A polynomial time algorithm for left [right] local 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 non-negative integers k and l and for some word u from L, a word v belongs to L iff: (1) the prefixes [suffixes] of length k - 1 of words u and v coincide, (2) the number of occurrences of every factor of length k in both words u and v are either the same or greater than l - 1.A deterministic finite automaton is called locally threshold testable if the automaton accepts a locally threshold testable language for some l and k.New necessary and sufficient conditions for a deterministic finite automaton to be locally threshold testable are found. On the basis of these conditions, we modify the algorithm to verify local threshold testability of the automaton, and to reduce the time complexity of the algorithm. The algorithm is implemented as a part of the C/C++ package TESTAS. http://www.cs.biu.ac.il/ ~trakht/Testas.html.