协调表选择替换系统的复杂性
On the Complexity of Coordinated Table Selective Substitution Systems
摘要：
我们调查所使用的计算资源的图灵机（TM）和交替图灵机（ATM）接受协调表选择性替代系统产生的语言有两个组件。我们证明了一类语言生成的实时（RL; 0 S）系统，一种替代设备，以产生无冗余标记标记Petri网语言，可以接受的非确定性TM在O（log n）空间和O（nlog n）时间。因此，Petri网语言（也称为L语言）的这个适当子类包含在NSPACE（log n）中。由（RL; RB）-系统生成的语言类，其RL-文法的非终结符由一个符号组成，RB-文法的非终结符由两个符号组成，可被ATM机在O（log n）的时间和空间上接受.因此，这个由只有一个控制状态的单计数器机器生成的单计数器语言的真子类包含在U_E*-uniform NC 1中，因此包含在SPACE（log n）中。
英文摘要：
We investigate computational resources used by Turing machines (TMs) and alternating Turing machines (ATMs) to accept languages generated by coordinated table selective substitution systems with two components. We prove that the class of languages generated by real-time (RL; 0S)-systems, an alternative device to generate lambda-free labeled marked Petri nets languages, can be accepted by nondeterministic TMs in O(log n) space and O(nlog n) time. Consequently, this proper sub-class of Petri nets languages (known also as L-languages) is included in NSPACE(log n). The class of languages generated by (RL; RB)-systems for which the nonterminal alphabet of the RL-grammar is composed of only one symbol and the nonterminal alphabet of the RB-grammar is composed of two symbols, can be accepted by ATMs in O(log n) time and space. Consequently, this proper subclass of one-counter languages generated by one-counter machines with only one control state is included in U_E*-uniform NC1, hence in SPACE(log n).
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
