8 citations · 17 across the 8 of their papers we have counts for
7 papers · 1 filter
A polynomial time algorithm for local testability and its level
A. N. Trahtman
A locally testable semigroup S is a semigroup with the property that for some nonnegative integer k, called the order or level of local testability, two words u and v in some set o…
Verification Tools for Checking some kinds of Testability
A. N. Trahtman
A locally testable language L is a language with the property that for some non negative integer k, called the order of local testability, whether or not a word u is in the languag…
An algorithm to verify local threshold testability of deterministic finite automata
A. N. Trahtman
A locally threshold testable language L is a language with the property that for some non negative integers k and l, whether or not a word u is in the language L depends on (1) the…
Reducing the time complexity of testing for local threshold testability
A. N. Trahtman
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 if and only if…
Some new Features and Algorithms for the Study of DFA
Avraham N. Trahtman
The work presents some new algorithms realized recently in the package TESTAS. They decide whether or not deterministic finite automaton (DFA) is synchronizing, several procedures…
Polynomial time algorithm for left [right] local testability
A. N. Trahtman
A right [left] locally testable language S is a language with the property that for some non negative integer k two words u and v in alphabet S are equal in the semi group if (1) t…