论文标题
DFA研究的一些新功能和算法
Some new Features and Algorithms for the Study of DFA
论文作者
论文摘要
这项工作介绍了最近在Tastas中实现的一些新算法。他们决定确定性有限自动机（DFA）是否同步，几个过程发现相对较短的同步单词和最小长度的同步单词。我们检查有向图的着色的存在，该图将图形变成同步的DFA。该算法如果存在算法（众所周知的道路着色）。否则，可以找到K同步的道路着色。我们根据其结构属性对自动机的图进行了线性可视化。
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.
