Skip to Main content Skip to Navigation
Journal articles

The Černý conjecture for aperiodic automata

Abstract : A word w is called a synchronizing (recurrent, reset, directable) word of a deterministic finite automaton (DFA) if w brings all states of the automaton to some specific state; a DFA that has a synchronizing word is said to be synchronizable. Cerny conjectured in 1964 that every n-state synchronizable DFA possesses a synchronizing word of length at most (n-1)2. We consider automata with aperiodic transition monoid (such automata are called aperiodic). We show that every synchronizable n-state aperiodic DFA has a synchronizing word of length at most n(n-1)/2. Thus, for aperiodic automata as well as for automata accepting only star-free languages, the Cerny conjecture holds true.
Document type :
Journal articles
Complete list of metadata

Cited literature [12 references]  Display  Hide  Download
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s Connect in order to contact the contributor
Submitted on : Wednesday, March 26, 2014 - 5:01:53 PM
Last modification on : Wednesday, November 29, 2017 - 10:26:22 AM
Long-term archiving on: : Thursday, June 26, 2014 - 12:00:43 PM


Files produced by the author(s)




Avraham N. Trahtman. The Černý conjecture for aperiodic automata. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2007, Vol. 9 no. 2 (2), pp.3--10. ⟨10.46298/dmtcs.395⟩. ⟨hal-00966534⟩



Record views


Files downloads