道路着色算法在TESTAS软件包中的可视化
The Visualization of the Road Coloring Algorithm in the package TESTAS
摘要：
一个确定性自动机的同步字是其边缘颜色字母表中的一个字，它将自动机映射到单个状态。一个有向图的边的染色是同步的，如果染色使图成为一个具有同步字的确定性有限自动机。道路染色问题是指当有向有限强连通图的所有圈的长度的最大公约数为1时，图的所有顶点的出度均为常数的有向有限强连通图的同步染色问题。基于这一著名问题最近的正解，给出了道路着色的一个多项式时间算法。人们可以使用我们的新的可视化程序演示的算法，以及可视化的过渡图的任何有限自动机。视觉图像呈现了转移图的一些结构性质。此帮助工具在自动机的大小方面是线性的。
英文摘要：
A synchronizing word of a deterministic automaton is a word in the alphabet of colors of its edges that maps the automaton to a single state. A coloring of edges of a directed graph is synchronizing if the coloring turns the graph into a deterministic finite automaton possessing a synchronizing word. The road coloring problem is the problem of synchronizing coloring of a directed finite strongly connected graph with constant outdegree of all its vertices if the greatest common divisor of the lengths of all its cycles is one. A polynomial time algorithm of the road coloring has been based on recent positive solution of this old famous problem. One can use our new visualization program for demonstration of the algorithm as well as for visualization of the transition graph of any finite automaton. The visual image presents some structure properties of the transition graph. This help tool is linear in the size of the automaton.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
