连通图上射击班/暴徒同步问题的信号机和元胞自动机时间最优拟解
Signal Machine And Cellular Automaton Time-Optimal Quasi-Solutions Of The Firing Squad/Mob Synchronisation Problem On Connected Graphs
摘要:
我们构建了一个时间最优的准解决方案的射击暴民同步问题的有限,连接,和无向的多重图,其最大程度的一致有界的常数。它只是一个拟解,因为它的状态数取决于图,或者从另一个角度来看,不取决于图,而是可数无限的。为了构建这个准解决方案,我们引入信号机在连续表示这样的多重图,并构建一个信号机的离散化是一个元胞自动机,准解决问题。这个自动机使用一个时间最优的解决方案的行刑队同步问题的维度之一,一个一般在一端同步边缘,并冻结和解冻的同步的边缘,在这样一种方式,所有的边缘同步在同一时间。
英文摘要:
We construct a time-optimal quasi-solution of the firing mob synchronisation problem over finite, connected, and undirected multigraphs whose maximum degrees are uniformly bounded by a constant. It is only a quasi-solution because its number of states depends on the graph or, from another perspective, does not depend on the graph but is countably infinite. To construct this quasi-solution we introduce signal machines over continuum representations of such multigraphs and construct a signal machine whose discretisation is a cellular automaton that quasi-solves the problem. This automaton uses a time-optimal solution of the firing squad synchronisation problem in dimension one with one general at one end to synchronise edges, and freezes and thaws the synchronisation of edges in such a way that all edges synchronise at the same time.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。