On the synchronization of planar automata
Lecture Notes in Computer Science(2016)
摘要
Planar automata seems to be representative of the synchronizing behavior of deterministic finite state automata. We conjecture that Černy's conjecture holds true, if and only if, it holds true for planar automata. In this paper we have gathered some evidence concerning this conjecture. This evidence amounts to show that the class of planar automata is representative of the algorithmic hardness of synchronization
更多查看译文
关键词
Deterministic Finite State Automata, Reset Word, Subset Synchronization, Algorithmic Hardness, Longest Common Subsequence Problem
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要