A. N. Trahtman An Efficient Algorithm Finds Noticeable Trends and Examples Concerning the Cerny Conjecture. [Citation Graph (0, 0)][DBLP] MFCS, 2006, pp:789-800 [Conf]
A. N. Trahtman A Precise Estimation of the Order of Local Testability of a Deterministic Finite Automaton. [Citation Graph (0, 0)][DBLP] Workshop on Implementing Automata, 1997, pp:198-212 [Conf]
A. N. Trahtman An Algorithm to Verify Local Threshold Testability of Deterministic Finite Automata. [Citation Graph (0, 0)][DBLP] WIA, 1999, pp:164-173 [Conf]
A. N. Trahtman Optimal Estimation on the Order of Local Testability of Finite Automata. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2000, v:231, n:1, pp:59-74 [Journal]
A. N. Trahtman Algorithms finding the order of local testability of deterministic finite automaton and estimations of the order. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2000, v:235, n:1, pp:183-204 [Journal]
A. N. Trahtman Erratum to ``Optimal estimation on the order of local testability of finite automata'' - [TCS 231(2000) 59-74]. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2001, v:255, n:1-2, pp:697- [Journal]
A. N. Trahtman Reducing the time complexity of testing for local threshold testability. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2004, v:328, n:1-2, pp:151-160 [Journal]
A. N. Trahtman An efficient algorithm finds noticeable trends and examples concerning the Cerny conjecture [Citation Graph (0, 0)][DBLP] CoRR, 2007, v:0, n:, pp:- [Journal]