The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

A. N. Trahtman: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. A. N. Trahtman
    Piecewise and Local Threshold Testability of DFA. [Citation Graph (0, 0)][DBLP]
    FCT, 2001, pp:347-358 [Conf]
  2. 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]
  3. A. N. Trahtman
    A Polynomial Time Algorithm for Left [Right] Local Testability. [Citation Graph (0, 0)][DBLP]
    CIAA, 2002, pp:203-212 [Conf]
  4. A. N. Trahtman
    A Package TESTAS for Checking Some Kinds of Testability. [Citation Graph (0, 0)][DBLP]
    CIAA, 2002, pp:228-232 [Conf]
  5. 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]
  6. 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]
  7. 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]
  8. 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]
  9. 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]
  10. 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]
  11. A. N. Trahtman
    Synchronization of Some DFA. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:234-243 [Conf]
  12. A. N. Trahtman
    The road coloring problem [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  13. 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]

  14. Synchronizing Road Coloring. [Citation Graph (, )][DBLP]


  15. A Subquadratic Algorithm for Road Coloring [Citation Graph (, )][DBLP]


  16. The Road Coloring for Mapping on k States [Citation Graph (, )][DBLP]


  17. The Visualization of the Road Coloring Algorithm in the package TESTAS [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002