用小格状自动机表示一个P-完全问题
Representing a P-complete problem by small trellis automata
摘要：
电路值问题的被称为顺序NOR电路值问题的受限情况最近被用于获得表示P-完全语言的合取语法、布尔语法和语言方程的非常简洁的示例（Okhotin，http://dx.doi.org/10.1007/978-3-540-74593-8_23“A simple P-complete problem and its representations by language equations”，MCU 2007）。本文对这一问题提出了一种新的编码方法，并构造了一个具有11个状态的格状自动机（单向实时元胞自动机）来解决这一问题。
英文摘要：
A restricted case of the Circuit Value Problem known as the Sequential NOR Circuit Value Problem was recently used to obtain very succinct examples of conjunctive grammars, Boolean grammars and language equations representing P-complete languages (Okhotin, http://dx.doi.org/10.1007/978-3-540-74593-8_23 "A simple P-complete problem and its representations by language equations", MCU 2007). In this paper, a new encoding of the same problem is proposed, and a trellis automaton (one-way real-time cellular automaton) with 11 states solving this problem is constructed.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
