A survey of the state-of-the-art of the theory of synchronizing automata is given in its part
concerned with the case of complete deterministic automata. Algorithmic and complexity …

We study the computational complexity of various problems related to synchronization of
weakly acyclic automata, a subclass of widely studied aperiodic automata. We provide …

We study synchronizing partial DFAs, which extend the classical concept of synchronizing
complete DFAs and are a special case of synchronizing unambiguous NFAs. A partial DFA …

Let n be a natural number and M a set of nx n-matrices over the nonnegative integers such
that M generates a finite multiplicative monoid. We show that if the zero matrix 0 is a product …

A synchronizing word of a deterministic finite complete automaton is a word whose action
maps every state to a single one. Finding a shortest or a short synchronizing word is a …

Prefix codes such as Huffman codes are commonly used for loseless data compression. The
class of synchronizing codes is often chosen to improve error resilience or to enable parallel …

Let n be a natural number, and let M be a set of n*n-matrices over the nonnegative integers
such that the joint spectral radius of M is at most one. We show that if the zero matrix 0 is a …

Синхронизация конечных автоматов–направление дискретной математики,
первоначальные понятия которого очень прозрачны, поскольку непосредственно …

A synchronizing word of a deterministic finite automaton is a word whose action maps every
state to a single one. Finding a short or a shortest synchronizing word is a central …

This thesis is devoted to studying synchronizing words for finite automata and variable-
length codes. Intuitively, a synchronizing word is a word such that its application brings a …