A. N. Trahtman

35 papers B 3C 4Journal 25Unranked 3

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