A Precise Estimation of the Order of Local Testability of a Deterministic Finite Automaton. - A. N. Trahtman (Workshop on Implementing Automata, 1997)

An Algorithm to Verify Local Threshold Testability of Deterministic Finite Automata. - A. N. Trahtman (WIA, 1999)

A Polynomial Time Algorithm for Local Testability and its Level. - A. N. Trahtman (Int. J. Algebra Comput., 1999)

Optimal Estimation on the Order of Local Testability of Finite Automata. - A. N. Trahtman (Theor. Comput. Sci., 2000)

Algorithms finding the order of local testability of deterministic finite automaton and estimations of the order. - A. N. Trahtman (Theor. Comput. Sci., 2000)

Piecewise and Local Threshold Testability of DFA. - A. N. Trahtman (FCT, 2001)

Erratum to "Optimal estimation on the order of local testability of finite automata" - [TCS 231(2000) 59-74]. - A. N. Trahtman (Theor. Comput. Sci., 2001)

A Polynomial Time Algorithm for Left [Right] Local Testability. - A. N. Trahtman (CIAA, 2002)

A Package TESTAS for Checking Some Kinds of Testability. - A. N. Trahtman (CIAA, 2002)

The Identities of Local Threshold Testability. - Avraham Trakhtman (Grammars and Automata for String Processing, 2003)

Reducing the Time Complexity of Testing for Local Threshold Testability. - Avraham Trakhtman (CIAA, 2003)

An Efficient Algorithm Finds Noticeable Trends and Examples Concerning the Cerny Conjecture. - A. N. Trahtman (MFCS, 2006)

Notable trends concerning the synchronization of graphs and automata. - A. N. Trahtman (Electron. Notes Discret. Math., 2006)

Synchronization of Some DFA. - A. N. Trahtman (TAMC, 2007)

The road coloring problem - A. N. Trahtman (CoRR, 2007)

The Černý Conjecture for Aperiodic Automata. - Avraham Trakhtman (Discret. Math. Theor. Comput. Sci., 2007)

Synchronizing Road Coloring. - A. N. Trahtman (IFIP TCS, 2008)

The Road Coloring and Cerny Conjecture. - Avraham Trakhtman (Stringology, 2008)

A Subquadratic Algorithm for Road Coloring - A. N. Trahtman (CoRR, 2008)

Some Aspects of Synchronization of DFA. - Avraham Trakhtman (J. Comput. Sci. Technol., 2008)

The Visualization of the Road Coloring Algorithm in the package TESTAS - A. N. Trahtman; Tomer Bauer; Noam Cohen (CoRR, 2009)

Linear Visualization of a Road Coloring. - Avraham Trakhtman; Tomer Bauer; Noam Cohen (CTW, 2010)

A Partially Synchronizing Coloring. - Avraham Trakhtman (CSR, 2010)

Modifying the Upper Bound on the Length of Minimal Synchronizing Word. - A. N. Trahtman (FCT, 2011)

An Algorithm for Road Coloring. - A. N. Trahtman (IWOCA, 2011)

The length of a minimal synchronizing word and the Černy conjecture. - A. N. Trahtman (CoRR, 2014)

A Note on a Recent Attempt to Improve the Pin-Frankl Bound. - François Gonze; Raphaël M. Jungers; Avraham Trakhtman (Discret. Math. Theor. Comput. Sci., 2015)

Matrix approach to synchronizing automata. - A. N. Trahtman (CoRR, 2019)

Cerny-Starke conjecture from the sixties of XX century. - A. N. Trahtman (CoRR, 2020)

Verification Tools for Checking some kinds of Testability. - A. N. Trahtman (CoRR, 2021)

The algebra of row monomial matrices. - A. N. Trahtman (CoRR, 2021)