A. N. Trahtman - Citegraph

Author Info

Name	Affiliation	Papers
A. N. TRAHTMAN	Dep. of Math., Bar-Ilan University, 52900 Ramat Gan Israel	20
Collaborators	Citations	PageRank
3	92	11.68
Referers	Referees	References
92	90	144

Publications (20 rows)

Collaborators (3 rows)

Referers (92 rows)

Referees (90 rows)

Title	Citations	PageRank	Year
The length of a minimal synchronizing word and the Černy conjecture.	0	0.34	2014
The Černy conjecture	0	0.34	2012
An algorithm for road coloring	3	0.53	2012
Modifying the upper bound on the length of minimal synchronizing word	25	1.83	2011
A Partially Synchronizing Coloring	0	0.34	2010
The Visualization of the Road Coloring Algorithm in the package TESTAS	0	0.34	2009
Synchronizing Road Coloring	3	0.52	2008
A Subquadratic Algorithm for Road Coloring	5	0.66	2008
Some Aspects of Synchronization of DFA	2	0.65	2008
The Road Coloring for Mapping on k States	1	0.39	2008
An efficient algorithm finds noticeable trends and examples concerning the Cerny conjecture	5	0.49	2007
The road coloring problem	13	1.08	2007
A package TESTAS for checking some kinds of testability	7	0.58	2002
Piecewise and Local Threshold Testability of DFA	12	0.88	2001
Erratum to ``Optimal estimation on the order of local testability of finite automata'' - [TCS 231(2000) 59-74]	0	0.34	2001
Algorithms finding the order of local testability of deterministic finite automaton and estimations of the order	2	0.40	2000
Optimal estimation on the order of local testability of finite automata	3	0.56	2000
An Algorithm to Verify Local Threshold Testability of Deterministic Finite Automata	4	0.45	1999
A Polynomial Time Algorithm For Local Testability And Its Level	4	0.51	1999
A Precise Estimation of the Order of Local Testability of a Deterministic Finite Automaton	3	0.47	1997