相关论文: The Cerny conjecture for automata respecting inter…
A deterministic finite automaton is synchronizing if there exists a word that sends all states of the automaton to the same state. \v{C}ern\'y conjectured in 1964 that a synchronizing automaton with $n$ states has a synchronizing word of…
We survey results in the literature that establish the \v{C}ern\'y conjecture for various classes of finite automata. We also list classes for which the conjecture remains open, but a quadratic (in the number of states) upper bound on the…
We present a report from a series of experiments involving computation of the shortest reset words for automata with small number of states. We confirm that the \v{C}ern\'{y} conjecture is true for all automata with at most 11 states on 2…
A word w is called a synchronizing (recurrent, reset) word of a deterministic finite automaton (DFA) if w brings all states of the automaton to some state; a DFA that has a synchronizing word is said to be synchronizing. Cerny conjectured…
We have improved an algorithm generating synchronizing automata with a large length of the shortest reset words. This has been done by refining some known results concerning bounds on the reset length. Our improvements make possible to…
The \v{C}ern\'y conjecture (\v{C}ern\'y, 1964) states that each n-state \san\ possess a \sw\ of length $(n-1)^2$. From the other side the best upper bound for the \rl\ of n-state \sa\ known so far is equal to $\frac{n^3-n}6$ (Pin, 1983) and…
A synchronizing word for an automaton is a word that brings that automaton into one and the same state, regardless of the starting position. Cerny conjectured in 1964 that if a n-state deterministic automaton has a synchronizing word, then…
A word $s$ of letters on edges of underlying graph $\Gamma$ of deterministic finite automaton (DFA) is called synchronizing if $s$ sends all states of the automaton to a unique state. J. \v{C}erny discovered in 1964 a sequence of $n$-state…
A word w of letters on edges of underlying graph Gamma of deterministic finite automaton (DFA) is called the synchronizing word if w sends all states of the automaton to a unique state. J. Cerny discovered in 1964 a sequence of n-state…
A word $w$ of letters on edges of underlying graph $\Gamma$ of deterministic finite automaton (DFA) is called synchronizing if $w$ sends all states of the automaton to a unique state. J. \v{C}erny discovered in 1964 a sequence of $n$-state…
The aim of this paper is to prove the \v{C}ern\'y conjecture and the rank conjecture for \v{C}ern\'y type automata and monoids. A transformation monoid is said to be \v{C}ern\'y type if it is generated by a simple idempotent and a regular…
We study synchronizing automata with the shortest reset words of relatively large length. First, we refine the Frankl-Pin result on the length of the shortest words of rank $m$, and the B\'eal, Berlinkov, Perrin, and Steinberg results on…
A word w is called synchronizing (recurrent, reset, directed) word of a deterministic finite automaton (DFA) if w sends all states of the automaton on a unique state. Jan Cerny had found in 1964 a sequence of n-state complete DFA with…
Cerny's conjecture is a longstanding open problem in automata theory. We study two different concepts, which allow to approach it from a new angle. The first one is the triple rendezvous time, i.e., the length of the shortest word mapping…
The results of several papers concerning the \v{C}ern\'y conjecture are deduced as consequences of a simple idea that I call the averaging trick. This idea is implicitly used in the literature, but no attempt was made to formalize the proof…
We prove the Cerny conjecture for one-cluster automata with prime length cycle. Consequences are given for the hybrid Road-coloring-Cerny conjecture for digraphs with a proper cycle of prime length.
The class of row monomial matrices (one unit and rest zeros in every row) with some non-standard operations of summation and usual multiplication is our main object. These matrices generate a space with respect to the mentioned operations.…
An automaton is synchronizing if there is a word that maps all states onto the same state. \v{C}ern\'{y}'s conjecture on the length of the shortest such word is probably the most famous open problem in automata theory. We consider the…
We present a few classes of synchronizing automata exhibiting certain extremal properties with regard to synchronization. The first is a series of automata with subsets whose shortest extending words are of length $\varTheta(n^2)$, where…
For any synchronizing $n$-state deterministic automaton, \v{C}ern\'{y} conjectures the existence of a synchronizing word of length at most $(n-1)^2$. We prove that there exists a synchronizing word of length at most $2n^2 - 7n + 7$ for…