The work presents some new algorithms realized recently in the package TESTAS. They decide whether or not deterministic finite automaton (DFA) is synchronizing, several procedures find relatively short synchronizing words and a synchronizing word of the minimal length. We check the existence of a coloring of directed graph that turns the graph into a synchronizing DFA. The algorithm finds the coloring (better known as the road coloring) if it exists. Otherwise, the k-synchronizing road coloring can be found. We use a linear visualization of the graph of an automaton based on its structural properties.

中文翻译：

---

DFA研究的一些新特征和算法

这项工作展示了最近在 TESTAS 包中实现的一些新算法。他们决定确定性有限自动机 (DFA) 是否正在同步，几个程序找到相对较短的同步字和最小长度的同步字。我们检查有向图的着色是否存在，该着色将图转换为同步 DFA。如果存在，该算法会找到着色（更好地称为道路着色）。否则，可以找到 k 同步道路着色。我们根据自动机的结构属性使用自动机图形的线性可视化。