神经网络和Hyperdag P系统中射击班同步问题的新解法
New Solutions to the Firing Squad Synchronization Problems for Neural and Hyperdag P Systems
摘要：
我们提出了两个统一的解决方案，一个开放的问题：射击队同步问题（FSSP），hyperdag和对称神经P系统，匿名细胞。我们的解分别需要e_c+5步和6 e_c +7步，其中e_c是这些P系统的dag或有向图的命令单元的偏心率。第一个和快速的解决方案是基于一个新的建议，它动态地扩展P系统与移动信道。第二种解决方案要长得多，但完全基于经典规则和静态通道。与以前的解决方案相比，它适用于基于树的P系统，我们的解决方案同步到底层有向图的任何子集;不需要膜极化或条件规则，但需要状态，通常用于hyperdag和神经P系统。
英文摘要：
We propose two uniform solutions to an open question: the Firing Squad Synchronization Problem (FSSP), for hyperdag and symmetric neural P systems, with anonymous cells. Our solutions take e_c+5 and 6e_c+7 steps, respectively, where e_c is the eccentricity of the commander cell of the dag or digraph underlying these P systems. The first and fast solution is based on a novel proposal, which dynamically extends P systems with mobile channels. The second solution is substantially longer, but is solely based on classical rules and static channels. In contrast to the previous solutions, which work for tree-based P systems, our solutions synchronize to any subset of the underlying digraph; and do not require membrane polarizations or conditional rules, but require states, as typically used in hyperdag and neural P systems.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
