8 citations · 17 across the 8 of their papers we have counts for
Showing 2020Show all
3 papers · 1 filter
cs.FL2020★ 2 cited
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…
cs.FL2020
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…
cs.FL2020★ 6 cited
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…