A. N. Trahtman

Publication Activity (10 Years)

Years Active: 1997-2022
Publications (10 Years): 12

Top Topics

Algebraic Expressions

Binary Matrices

Deterministic Finite Automata

Top Venues

Publications

A. N. Trahtman
A polynomial time algorithm for local testability and its level. CoRR (2022)
A. N. Trahtman
A Partially Synchronizing Coloring. CoRR (2022)
A. N. Trahtman
A package TESTAS for checking some kinds of testability. CoRR (2021)
A. N. Trahtman
An algorithm to verify local threshold testability of deterministic finite automata. CoRR (2021)
A. N. Trahtman
The algebra of row monomial matrices. CoRR (2021)
A. N. Trahtman
Verification Tools for Checking some kinds of Testability. CoRR (2021)
A. N. Trahtman
The Černy Conjecture for aperiodic automata. CoRR (2021)
A. N. Trahtman
Polynomial time algorithm for left [right] local testability. CoRR (2020)
A. N. Trahtman
Cerny-Starke conjecture from the sixties of XX century. CoRR (2020)
A. N. Trahtman
Precise estimation on the order of local testability of deterministic finite automaton. CoRR (2020)
A. N. Trahtman
Reducing the time complexity of testing for local threshold testability. CoRR (2020)
A. N. Trahtman
Matrix approach to synchronizing automata. CoRR (2019)
A. N. Trahtman
The length of a minimal synchronizing word and the Černy conjecture. CoRR (2014)
François Gonze, Raphaël M. Jungers, A. N. Trahtman
A Note on a Recent Attempt to Improve the Pin-Frankl Bound. CoRR (2014)
A. N. Trahtman
An algorithm for road coloring. J. Discrete Algorithms 16 (2012)
A. N. Trahtman
Modifying the Upper Bound on the Length of Minimal Synchronizing Word. FCT (2011)
A. N. Trahtman
An Algorithm for Road Coloring. IWOCA (2011)
A. N. Trahtman, Tomer Bauer, Noam Cohen
The Visualization of the Road Coloring Algorithm in the package TESTAS CoRR (2009)
A. N. Trahtman
A Subquadratic Algorithm for Road Coloring CoRR (2008)
A. N. Trahtman
Synchronizing Road Coloring. IFIP TCS (2008)
A. N. Trahtman
An efficient algorithm finds noticeable trends and examples concerning the Cerny conjecture CoRR (2007)
A. N. Trahtman
The road coloring problem CoRR (2007)
A. N. Trahtman
Synchronization of Some DFA. TAMC (2007)
A. N. Trahtman
An Efficient Algorithm Finds Noticeable Trends and Examples Concerning the Cerny Conjecture. MFCS (2006)
A. N. Trahtman
Notable trends concerning the synchronization of graphs and automata. Electron. Notes Discret. Math. 25 (2006)
A. N. Trahtman
Reducing the time complexity of testing for local threshold testability. Theor. Comput. Sci. 328 (1-2) (2004)
A. N. Trahtman
A Polynomial Time Algorithm for Left [Right] Local Testability. CIAA (2002)
A. N. Trahtman
A Package TESTAS for Checking Some Kinds of Testability. CIAA (2002)
A. N. Trahtman
Erratum to "Optimal estimation on the order of local testability of finite automata" - [TCS 231(2000) 59-74]. Theor. Comput. Sci. 255 (1-2) (2001)
A. N. Trahtman
Piecewise and Local Threshold Testability of DFA. FCT (2001)
A. N. Trahtman
Algorithms finding the order of local testability of deterministic finite automaton and estimations of the order. Theor. Comput. Sci. 235 (1) (2000)
A. N. Trahtman
Optimal Estimation on the Order of Local Testability of Finite Automata. Theor. Comput. Sci. 231 (1) (2000)
A. N. Trahtman
An Algorithm to Verify Local Threshold Testability of Deterministic Finite Automata. WIA (1999)
A. N. Trahtman
A Polynomial Time Algorithm for Local Testability and its Level. Int. J. Algebra Comput. 9 (1) (1999)
A. N. Trahtman
A Precise Estimation of the Order of Local Testability of a Deterministic Finite Automaton. Workshop on Implementing Automata (1997)