We stand with Ukraine  

Avraham Trakhtman

Affiliations:
  • Bar-Ilan University, Ramat Gan, Israel


According to our database1, Avraham Trakhtman authored at least 31 papers between 1997 and 2021.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
The algebra of row monomial matrices.
[BibTeX]
[DOI]
A. N. Trahtman
CoRR, 2021

Verification Tools for Checking some kinds of Testability.
[BibTeX]
[DOI]
A. N. Trahtman
CoRR, 2021

2020
Cerny-Starke conjecture from the sixties of XX century.
[BibTeX]
[DOI]
A. N. Trahtman
CoRR, 2020

2019
Matrix approach to synchronizing automata.
[BibTeX]
[DOI]
A. N. Trahtman
CoRR, 2019

2015
A Note on a Recent Attempt to Improve the Pin-Frankl Bound.
[BibTeX]
[DOI]
François Gonze
,
Raphaël M. Jungers
,
Avraham Trakhtman
Discret. Math. Theor. Comput. Sci., 2015

2014
The length of a minimal synchronizing word and the Černy conjecture.
[BibTeX]
[DOI]
A. N. Trahtman
CoRR, 2014

2012
An algorithm for road coloring.
[BibTeX]
[DOI]
A. N. Trahtman
J. Discrete Algorithms, 2012

2011
Modifying the Upper Bound on the Length of Minimal Synchronizing Word.
[BibTeX]
[DOI]
A. N. Trahtman
Proceedings of the Fundamentals of Computation Theory - 18th International Symposium, 2011

2010
A Partially Synchronizing Coloring.
[BibTeX]
[DOI]
Avraham Trakhtman
Proceedings of the Computer Science, 2010

Linear Visualization of a Road Coloring.
[BibTeX]
Avraham Trakhtman
,
Tomer Bauer
,
Noam Cohen
Proceedings of the 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2010

2009
The Visualization of the Road Coloring Algorithm in the package TESTAS
[BibTeX]
[DOI]
A. N. Trahtman
,
Tomer Bauer
,
Noam Cohen
CoRR, 2009

2008
Some Aspects of Synchronization of DFA.
[BibTeX]
[DOI]
Avraham Trakhtman
J. Comput. Sci. Technol., 2008

A Subquadratic Algorithm for Road Coloring
[BibTeX]
[DOI]
A. N. Trahtman
CoRR, 2008

The Road Coloring and Cerny Conjecture.
[BibTeX]
[DOI]
Avraham Trakhtman
Proceedings of the Prague Stringology Conference 2008, Prague, Czech Republic, 2008

Synchronizing Road Coloring.
[BibTeX]
[DOI]
A. N. Trahtman
Proceedings of the Fifth IFIP International Conference On Theoretical Computer Science, 2008

2007
The Černý Conjecture for Aperiodic Automata.
[BibTeX]
[DOI]
Avraham Trakhtman
Discret. Math. Theor. Comput. Sci., 2007

The road coloring problem
[BibTeX]
[DOI]
A. N. Trahtman
CoRR, 2007

Synchronization of Some DFA.
[BibTeX]
[DOI]
A. N. Trahtman
Proceedings of the Theory and Applications of Models of Computation, 2007

2006
Notable trends concerning the synchronization of graphs and automata.
[BibTeX]
[DOI]
A. N. Trahtman
Electron. Notes Discret. Math., 2006

An Efficient Algorithm Finds Noticeable Trends and Examples Concerning the Cerny Conjecture.
[BibTeX]
[DOI]
A. N. Trahtman
Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

2004
Reducing the time complexity of testing for local threshold testability.
[BibTeX]
[DOI]
A. N. Trahtman
Theor. Comput. Sci., 2004

2003
The Identities of Local Threshold Testability.
[BibTeX]
Avraham Trakhtman
Proceedings of the Grammars and Automata for String Processing: From Mathematics and Computer Science to Biology, 2003

2002
A Package TESTAS for Checking Some Kinds of Testability.
[BibTeX]
[DOI]
A. N. Trahtman
Proceedings of the Implementation and Application of Automata, 2002

A Polynomial Time Algorithm for Left [Right] Local Testability.
[BibTeX]
[DOI]
A. N. Trahtman
Proceedings of the Implementation and Application of Automata, 2002

2001
Erratum to "Optimal estimation on the order of local testability of finite automata" - [TCS 231(2000) 59-74].
[BibTeX]
[DOI]
A. N. Trahtman
Theor. Comput. Sci., 2001

Piecewise and Local Threshold Testability of DFA.
[BibTeX]
[DOI]
A. N. Trahtman
Proceedings of the Fundamentals of Computation Theory, 13th International Symposium, 2001

2000
Algorithms finding the order of local testability of deterministic finite automaton and estimations of the order.
[BibTeX]
[DOI]
A. N. Trahtman
Theor. Comput. Sci., 2000

Optimal Estimation on the Order of Local Testability of Finite Automata.
[BibTeX]
[DOI]
A. N. Trahtman
Theor. Comput. Sci., 2000

1999
A Polynomial Time Algorithm for Local Testability and its Level.
[BibTeX]
[DOI]
A. N. Trahtman
Int. J. Algebra Comput., 1999

An Algorithm to Verify Local Threshold Testability of Deterministic Finite Automata.
[BibTeX]
[DOI]
A. N. Trahtman
Proceedings of the Automata Implementation, 1999

1997
A Precise Estimation of the Order of Local Testability of a Deterministic Finite Automaton.
[BibTeX]
[DOI]
A. N. Trahtman
Proceedings of the Automata Implementation, 1997


  Loading...