| |
A. N. Trahtman
List of publications from the DBLP Bibliography Server - FAQ
| 2008 | ||
|---|---|---|
| 20 | EE | A. N. Trahtman: Synchronizing Road Coloring. IFIP TCS 2008: 43-53 |
| 19 | EE | A. N. Trahtman: A Subquadratic Algorithm for Road Coloring CoRR abs/0801.2838: (2008) |
| 18 | EE | A. N. Trahtman: The Road Coloring for Mapping on k States CoRR abs/0812.4798: (2008) |
| 17 | EE | Avraham Trakhtman: Some Aspects of Synchronization of DFA. J. Comput. Sci. Technol. 23(5): 719-727 (2008) |
| 2007 | ||
| 16 | EE | A. N. Trahtman: Synchronization of Some DFA. TAMC 2007: 234-243 |
| 15 | EE | A. N. Trahtman: The road coloring problem CoRR abs/0709.0099: (2007) |
| 14 | EE | A. N. Trahtman: An efficient algorithm finds noticeable trends and examples concerning the Cerny conjecture CoRR abs/0709.1197: (2007) |
| 2006 | ||
| 13 | EE | A. N. Trahtman: An Efficient Algorithm Finds Noticeable Trends and Examples Concerning the Cerny Conjecture. MFCS 2006: 789-800 |
| 12 | EE | A. N. Trahtman: Notable trends concerning the synchronization of graphs and automata. Electronic Notes in Discrete Mathematics 25: 173-175 (2006) |
| 2004 | ||
| 11 | EE | A. N. Trahtman: Reducing the time complexity of testing for local threshold testability. Theor. Comput. Sci. 328(1-2): 151-160 (2004) |
| 2003 | ||
| 10 | EE | Avraham Trakhtman: Reducing the Time Complexity of Testing for Local Threshold Testability. CIAA 2003: 141-149 |
| 9 | Avraham Trakhtman: The Identities of Local Threshold Testability. Grammars and Automata for String Processing 2003: 347-358 | |
| 2002 | ||
| 8 | EE | A. N. Trahtman: A Polynomial Time Algorithm for Left [Right] Local Testability. CIAA 2002: 203-212 |
| 7 | EE | A. N. Trahtman: A Package TESTAS for Checking Some Kinds of Testability. CIAA 2002: 228-232 |
| 2001 | ||
| 6 | EE | A. N. Trahtman: Piecewise and Local Threshold Testability of DFA. FCT 2001: 347-358 |
| 5 | EE | 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): 697 (2001) |
| 2000 | ||
| 4 | EE | A. N. Trahtman: Optimal Estimation on the Order of Local Testability of Finite Automata. Theor. Comput. Sci. 231(1): 59-74 (2000) |
| 3 | EE | A. N. Trahtman: Algorithms finding the order of local testability of deterministic finite automaton and estimations of the order. Theor. Comput. Sci. 235(1): 183-204 (2000) |
| 1999 | ||
| 2 | EE | A. N. Trahtman: An Algorithm to Verify Local Threshold Testability of Deterministic Finite Automata. WIA 1999: 164-173 |
| 1997 | ||
| 1 | A. N. Trahtman: A Precise Estimation of the Order of Local Testability of a Deterministic Finite Automaton. Workshop on Implementing Automata 1997: 198-212 | |