带存储的状态语法
State Grammars with Stores
摘要：
状态文法是上下文无关文法，其中产生式具有与其关联的状态，并且只有当当前状态与产生式中的状态匹配时，才能将产生式应用于非终结符。一旦将状态添加到语法中，就很自然地添加各种存储，类似于机器模型。使用这样的扩展，只有当从每个存储读取的状态和值在当前的数据形式和生产之间匹配时，才能应用生产。在这里，发电能力的结果，提出了不同的衍生模式，有和没有额外的商店。特别是，与标准的推导关系，它表明，增加反向有界计数器并不增加容量，状态是足够的。此外，状态语法与反向有界计数器，使用最左边的推导操作，以符合语言接受的单向机与下推和反向有界计数器，这些令人惊讶的是严格弱于状态语法与标准的推导关系（和没有计数器）。空性问题的复杂性，涉及状态文法与反向有界计数器也进行了研究。
英文摘要：
State grammars are context-free grammars where the productions have states associated with them, and a production can only be applied to a nonterminal if the current state matches the state in the production. Once states are added to grammars, it is natural to add various stores, similar to machine models. With such extensions, productions can only be applied if both the state and the value read from each store matches between the current sentential form and the production. Here, generative capacity results are presented for different derivation modes, with and without additional stores. In particular, with the standard derivation relation, it is shown that adding reversal-bounded counters does not increase the capacity, and states are enough. Also, state grammars with reversal-bounded counters that operate using leftmost derivations are shown to coincide with languages accepted by one-way machines with a pushdown and reversal-bounded counters, and these are surprisingly shown to be strictly weaker than state grammars with the standard derivation relation (and no counters). The complexity of the emptiness problem involving state grammars with reversal-bounded counters is also studied.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
