arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0812.4798cs.DM
收藏

k状态映射的道路着色(已撤回)

The Road Coloring for Mapping on k States(withdrawn)

A. N. Trahtman

摘要:

设$Γ$是一致出度(任意点的出度都是常数)的有向强连通有限图,并通过对$Γ$的边进行染色使图成为确定性完全自动机.令单词$s$是$Γ$的边缘上的颜色字母表(也被认为是字母)中的单词,并且令$Γs$是顶点$Γ$的映射。

英文摘要:

Let $Γ$ be directed strongly connected finite graph of uniform outdegree (constant outdegree of any vertex) and let some coloring of edges of $Γ$ turn the graph into deterministic complete automaton. Let the word $s$ be a word in the alphabet of colors (considered also as letters) on the edges of $Γ$ and let $Γs$ be a mapping of vertices $Γ$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑