Avraham Trahtman
#17,573
Most Influential Person Now
Russian mathematician
Avraham Trahtman's AcademicInfluence.com Rankings
Avraham Trahtmanmathematics Degrees
Mathematics
#1306
World Rank
#2184
Historical Rank
Measure Theory
#5343
World Rank
#6320
Historical Rank
Download Badge
Mathematics
Avraham Trahtman's Degrees
- PhD Mathematics Moscow State University
Why Is Avraham Trahtman Influential?
(Suggest an Edit or Addition)According to Wikipedia, Avraham Naumovich Trahtman is a mathematician at Bar-Ilan University . In 2007, Trahtman solved a problem in combinatorics that had been open for 37 years, the Road Coloring Conjecture posed in 1970.
Avraham Trahtman's Published Works
Published Works
- The road coloring problem (2007) (112)
- An efficient algorithm finds noticeable trends and examples concerning the Černy conjecture (2006) (59)
- Modifying the upper bound on the length of minimal synchronizing word (2011) (54)
- Piecewise and Local Threshold Testability of DFA (2001) (33)
- Identities of a five-element 0-simple semigroup (1994) (32)
- The Černý Conjecture for Aperiodic Automata (2005) (30)
- The finite basis question for semigroups of order less than six (1983) (26)
- The moisture from the air as water resource in arid region: hopes, doubts and facts (2003) (22)
- The varieties of n-testable semigroups (1983) (19)
- SOME RESULTS OF IMPLEMENTED ALGORITHMS OF SYNCHRONIZATION (2012) (15)
- A POLYNOMIAL TIME ALGORITHM FOR LOCAL TESTABILITY AND ITS LEVEL (1999) (14)
- Identities of locally testable semigroups (1999) (13)
- Notable trends concerning the synchronization of graphs and automata (2006) (12)
- Synchronizing Road Coloring (2008) (11)
- A package TESTAS for checking some kinds of testability (2002) (11)
- Algorithms finding the order of local testability of deterministic finite automaton and estimations of the order (2000) (6)
- An Algorithm to Verify Local Threshold Testability of Deterministic Finite Automata (1999) (6)
- An algorithm for road coloring (2008) (5)
- Synchronization of some DFA (2007) (5)
- A Subquadratic Algorithm for Road Coloring (2008) (5)
- A Precise Estimation of the Order of Local Testability of a Deterministic Finite Automaton (1997) (5)
- A partially synchronizing coloring (2010) (4)
- Reducing the time complexity of testing for local threshold testability (2004) (3)
- The \v{C}erny Conjecture for aperiodic automata (2021) (2)
- Cerny-Starke conjecture from the sixties of XX century. (2020) (1)
- Optimal estimation on the order of local testability of finite automata (2000) (1)
- A polynomial time algorithm for left [right] local testability (2002) (1)
- The algebra of row monomial matrices (2021) (1)
- The Road Coloring for Mapping on k States (2008) (1)
- ALGORITHMS VERIFYING LOCAL THRESHOLD AND PIECEWISE TESTABILITY OF SEMIGROUP AND SOLVING ALMEIDA PROBLEM (Algebraic Semigroups, Formal Languages and Computation) (2001) (1)
- Response to the comment on “The moisture from the air as water resource in arid region: Hopes, doubt and facts” by Beysens et al. (2006) (0)
- Some new Features and Algorithms for the Study of DFA (2012) (0)
- Linear Visualization of a Road Coloring Algorithm (2009) (0)
- Row monomial matrices and Černy conjecture, short proof (2022) (0)
- The Černy conjecture (2012) (0)
- Matrix approach to synchronizing automata (2019) (0)
- The \v{C}erny conjecture (2012) (0)
- Verication Tools for Checking some kinds of Testability (2021) (0)
- Erratum to “Optimal estimation on the order of local testability of finite automata” (2001) (0)
- CERNY CONJECTURE FOR DFA ACCEPTING STAR-FREE LANGUAGES (2012) (0)
- Some Aspects of Synchronization of DFA (2008) (0)
- The length of a minimal synchronizing word and the Černy conjecture (2014) (0)
- Ja n 20 08 A Subquadratic Algorithm for Road Coloring (2008) (0)
- Linear Visualization of a Directed Finite Graph with Labels on Edges (2010) (0)
This paper list is powered by the following services:
Other Resources About Avraham Trahtman
What Schools Are Affiliated With Avraham Trahtman?
Avraham Trahtman is affiliated with the following schools: