论文标题
仔细同步部分确定性有限自动机
Careful synchronization of partial deterministic finite automata
论文作者
论文摘要
我们处理为给定的部分确定性自动机计算精心同步的最佳长度的任务，将问题编码为SAT的一个实例并调用SAT求解器。我们的实验表明，即使使用了非常适中的计算资源，这种方法为自动机提供了令人满意的结果。我们将我们的结果与第一作者获得精确同步的结果进行了比较，这是文献中研究的另一种同步版本，并得出了一些理论结论。
We approach the task of computing a carefully synchronizing word of optimum length for a given partial deterministic automaton, encoding the problem as an instance of SAT and invoking a SAT solver. Our experiments demonstrate that this approach gives satisfactory results for automata with up to 100 states even if very modest computational resources are used. We compare our results with the ones obtained by the first author for exact synchronization, which is another version of synchronization studied in the literature, and draw some theoretical conclusions.
