In this paper we propose two versions of polynomial algorithms which work better than well-known Eppstein's greedy algorithm and it is modification, a cycle ...

Automaton over alphabet A is called synchronizing if there exists a word w ∈ A ∗ which action resets A , that is, leaves the automaton in one particular state ...

in the maximal length of the shortest reset word considering all DFA's A with n states. Definition 3.1. C(n) := max{l(A) |A is a synchronizing DFA with n states} ...

This work has found a 5-state automaton over a 3-letter alphabet which attains the upper bound from the ˇ Cerny Conjecture, and a theorem describing the ...

Jul 3, 2022 · Abstract:A synchronizing word of a deterministic finite complete automaton is a word whose action maps every state to a single one.

We approach the task of computing a carefully synchronizing word of optimum length for a given partial deterministic automaton, encoding the problem as an ...

Abstract—Finding synchronizing sequences for the finite automata is a very important problem in many practical applications. (part orienters in industry, ...

Nov 17, 2013 · In this paper we give the details of our new algorithm for finding minimal reset words of finite synchronizing automata.

Although it is easy to decide whether a given automaton is synchronising and to compute a reset word, finding a shortest reset word seems to be a hard problem.

A word w of letters on edges of underlying graph Γ of deterministic finite automaton (DFA) is called synchronizing if w sends all states of the automaton to ...