default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAvraham Trakhtman
Person information
- affiliation: Bar-Ilan University, Ramat Gan, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[i18]A. N. Trahtman:
A polynomial time algorithm for local testability and its level. CoRR abs/2205.05434 (2022)- [i17]A. N. Trahtman:
A Partially Synchronizing Coloring. CoRR abs/2206.07116 (2022) - 2021
- [i16]A. N. Trahtman:
The Černy Conjecture for aperiodic automata. CoRR abs/2105.09105 (2021) - [i15]A. N. Trahtman:
An algorithm to verify local threshold testability of deterministic finite automata. CoRR abs/2105.10654 (2021) - [i14]A. N. Trahtman:
A package TESTAS for checking some kinds of testability. CoRR abs/2105.12583 (2021) - [i13]A. N. Trahtman:
Verification Tools for Checking some kinds of Testability. CoRR abs/2106.02312 (2021) - [i12]A. N. Trahtman:
The algebra of row monomial matrices. CoRR abs/2110.06839 (2021) - 2020
- [i11]A. N. Trahtman:
Cerny-Starke conjecture from the sixties of XX century. CoRR abs/2003.06177 (2020) - [i10]A. N. Trahtman:
Polynomial time algorithm for left [right] local testability. CoRR abs/2011.04236 (2020) - [i9]A. N. Trahtman:
Precise estimation on the order of local testability of deterministic finite automaton. CoRR abs/2011.06253 (2020) - [i8]A. N. Trahtman:
Reducing the time complexity of testing for local threshold testability. CoRR abs/2011.06262 (2020)
2010 – 2019
- 2019
- [i7]A. N. Trahtman:
Matrix approach to synchronizing automata. CoRR abs/1904.07694 (2019) - 2015
- [j10]François Gonze, Raphaël M. Jungers, Avraham Trakhtman:
A Note on a Recent Attempt to Improve the Pin-Frankl Bound. Discret. Math. Theor. Comput. Sci. 17(1): 307-308 (2015) - 2014
- [i6]A. N. Trahtman:
The length of a minimal synchronizing word and the Černy conjecture. CoRR abs/1405.2435 (2014) - [i5]François Gonze, Raphaël M. Jungers, A. N. Trahtman:
A Note on a Recent Attempt to Improve the Pin-Frankl Bound. CoRR abs/1412.0975 (2014) - 2012
- [j9]A. N. Trahtman:
An algorithm for road coloring. J. Discrete Algorithms 16: 213-223 (2012) - 2011
- [c15]A. N. Trahtman:
Modifying the Upper Bound on the Length of Minimal Synchronizing Word. FCT 2011: 173-180 - [c14]A. N. Trahtman:
An Algorithm for Road Coloring. IWOCA 2011: 349-360 - 2010
- [c13]Avraham Trakhtman, Tomer Bauer, Noam Cohen:
Linear Visualization of a Road Coloring. CTW 2010: 13-16 - [c12]Avraham Trakhtman:
A Partially Synchronizing Coloring. CSR 2010: 362-370
2000 – 2009
- 2009
- [i4]A. N. Trahtman, Tomer Bauer, Noam Cohen:
The Visualization of the Road Coloring Algorithm in the package TESTAS. CoRR abs/0907.2755 (2009) - 2008
- [j8]Avraham Trakhtman:
Some Aspects of Synchronization of DFA. J. Comput. Sci. Technol. 23(5): 719-727 (2008) - [c11]A. N. Trahtman:
Synchronizing Road Coloring. IFIP TCS 2008: 43-53 - [c10]Avraham Trakhtman:
The Road Coloring and Cerny Conjecture. Stringology 2008: 1-12 - [i3]A. N. Trahtman:
A Subquadratic Algorithm for Road Coloring. CoRR abs/0801.2838 (2008) - 2007
- [j7]Avraham Trakhtman:
The Černý Conjecture for Aperiodic Automata. Discret. Math. Theor. Comput. Sci. 9(2) (2007) - [c9]A. N. Trahtman:
Synchronization of Some DFA. TAMC 2007: 234-243 - [i2]A. N. Trahtman:
The road coloring problem. CoRR abs/0709.0099 (2007) - [i1]A. N. Trahtman:
An efficient algorithm finds noticeable trends and examples concerning the Cerny conjecture. CoRR abs/0709.1197 (2007) - 2006
- [j6]A. N. Trahtman:
Notable trends concerning the synchronization of graphs and automata. Electron. Notes Discret. Math. 25: 173-175 (2006) - [c8]A. N. Trahtman:
An Efficient Algorithm Finds Noticeable Trends and Examples Concerning the Cerny Conjecture. MFCS 2006: 789-800 - 2004
- [j5]A. N. Trahtman:
Reducing the time complexity of testing for local threshold testability. Theor. Comput. Sci. 328(1-2): 151-160 (2004) - 2003
- [c7]Avraham Trakhtman:
The Identities of Local Threshold Testability. Grammars and Automata for String Processing 2003: 347-358 - [c6]Avraham Trakhtman:
Reducing the Time Complexity of Testing for Local Threshold Testability. CIAA 2003: 141-149 - 2002
- [c5]A. N. Trahtman:
A Polynomial Time Algorithm for Left [Right] Local Testability. CIAA 2002: 203-212 - [c4]A. N. Trahtman:
A Package TESTAS for Checking Some Kinds of Testability. CIAA 2002: 228-232 - 2001
- [j4]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) - [c3]A. N. Trahtman:
Piecewise and Local Threshold Testability of DFA. FCT 2001: 347-358 - 2000
- [j3]A. N. Trahtman:
Optimal Estimation on the Order of Local Testability of Finite Automata. Theor. Comput. Sci. 231(1): 59-74 (2000) - [j2]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)
1990 – 1999
- 1999
- [j1]A. N. Trahtman:
A Polynomial Time Algorithm for Local Testability and its Level. Int. J. Algebra Comput. 9(1): 31-40 (1999) - [c2]A. N. Trahtman:
An Algorithm to Verify Local Threshold Testability of Deterministic Finite Automata. WIA 1999: 164-173 - 1997
- [c1]A. N. Trahtman:
A Precise Estimation of the Order of Local Testability of a Deterministic Finite Automaton. Workshop on Implementing Automata 1997: 198-212
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 22:57 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
