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 …

The length of a checking sequence (CS) generated from a deterministic, minimal, and
completely specified finite state machine model M of a system under test which does not …

Abstract Automata synchronization has many important applications, mostly in conformance
testing of electrical circuits, self-correcting codes and protocol testing. Finding a shortest …

We present a novel method to predict the length of the shortest synchronizing words of a
finite automaton by applying the machine learning approach. We introduce several so-called …

Flushing the cache, using instructions like clflush and wbinvd, is commonly proposed as a
countermeasure against access-based cache attacks. In this report, we show that several …

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 …

An automaton is synchronizing if there exists a word that sends all states of the automaton to
a single state. The reset threshold is the length of the shortest such word. We study the set …

Given a subset of states S of a deterministic finite automaton and a word w, the preimage is
the subset of all states mapped to a state in S by the action of w. We study three natural …

Given a subset of states S of a deterministic finite automaton and a word w, the preimage is
the subset of all states that are mapped to a state from S by the action of w. We study the …

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 …