191 research outputs found
Synchronizing automata with a letter of deficiency 2
AbstractWe present two infinite series of synchronizing automata with a letter of deficiency 2 whose shortest reset words are longer than those for synchronizing automata obtained by a straightforward modification of Černý’s construction
Experimental Study of the Shortest Reset Word of Random Automata
In this paper we describe an approach to finding the shortest reset word of a
finite synchronizing automaton by using a SAT solver. We use this approach to
perform an experimental study of the length of the shortest reset word of a
finite synchronizing automaton. The largest automata we considered had 100
states. The results of the experiments allow us to formulate a hypothesis that
the length of the shortest reset word of a random finite automaton with
states and 2 input letters with high probability is sublinear with respect to
and can be estimated as $1.95 n^{0.55}.
Slowly synchronizing automata and digraphs
We present several infinite series of synchronizing automata for which the
minimum length of reset words is close to the square of the number of states.
These automata are closely related to primitive digraphs with large exponent.Comment: 13 pages, 5 figure
Reset thresholds of automata with two cycle lengths
We present several series of synchronizing automata with multiple parameters,
generalizing previously known results. Let p and q be two arbitrary co-prime
positive integers, q > p. We describe reset thresholds of the colorings of
primitive digraphs with exactly one cycle of length p and one cycle of length
q. Also, we study reset thresholds of the colorings of primitive digraphs with
exactly one cycle of length q and two cycles of length p.Comment: 11 pages, 5 figures, submitted to CIAA 201
Primitive digraphs with large exponents and slowly synchronizing automata
We present several infinite series of synchronizing automata for which the
minimum length of reset words is close to the square of the number of states.
All these automata are tightly related to primitive digraphs with large
exponent.Comment: 23 pages, 11 figures, 3 tables. This is a translation (with a
slightly updated bibliography) of the authors' paper published in Russian in:
Zapiski Nauchnyh Seminarov POMI [Kombinatorika i Teorija Grafov. IV], Vol.
402, 9-39 (2012), see ftp://ftp.pdmi.ras.ru/pub/publicat/znsl/v402/p009.pdf
Version 2: a few typos are correcte
The averaging trick and the Cerny conjecture
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 scheme axiomatically. Instead, authors axiomatized classes of
automata to which it applies
On the Synchronizing Probability Function and the Triple Rendezvous Time for Synchronizing Automata
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 three states onto a single one. The second one is the synchronizing
probability function of an automaton, a recently introduced tool which
reinterprets the synchronizing phenomenon as a two-player game, and allows to
obtain optimal strategies through a Linear Program.
Our contribution is twofold. First, by coupling two different novel
approaches based on the synchronizing probability function and properties of
linear programming, we obtain a new upper bound on the triple rendezvous time.
Second, by exhibiting a family of counterexamples, we disprove a conjecture on
the growth of the synchronizing probability function. We then suggest natural
follow-ups towards Cernys conjecture.Comment: A preliminary version of the results has been presented at the
conference LATA 2015. The current ArXiv version includes the most recent
improvement on the triple rendezvous time upper bound as well as formal
proofs of all the result
Primitive Automata that are Synchronizing
A deterministic finite (semi)automaton is primitive if its transition monoid
(semigroup) acting on the set of states has no non-trivial congruences. It is
synchronizing if it contains a constant map (transformation). In analogy to
synchronizing groups, we study the possibility of characterizing automata that
are synchronizing if primitive. We prove that the implication holds for several
classes of automata. In particular, we show it for automata whose every letter
induce either a permutation or a semiconstant transformation (an idempotent
with one point of contraction) unless all letters are of the first type. We
propose and discuss two conjectures about possible more general
characterizations.Comment: Note: The weak variant of our conjecture in a stronger form has been
recently solved by Mikhail Volkov arXiv:2306.13317, together with several new
results concerning our proble
- …