存储语言及其应用
On Store Languages and Applications
摘要：
某种任意类型机器的存储语言是所有存储配置（状态加上存储内容，但不包括输入）的集合，这些配置可以出现在接受计算中。新的算法和特征的存储语言，如结果，任何不确定性的下推自动机增加了反向有界计数器，其中的下推可以“翻转”其内容的次数有界，可以接受的机器只有反向有界计数器。然后，在存储语言和几个模型检验和可达性问题之间建立联系，例如从给定的配置集合中接受所有前导和后继配置的集合，并确定在接受两台机器的计算之间是否存在至少一个或无限多个公共配置。这些是针对各种不同的机器模型进行探索的，这些机器模型通常包含多个并行数据存储。许多研究的机器模型可以接受一组前任配置（一组规则的配置），一组后继配置，以及两台机器之间的一组公共配置，其中一个机器模型比它本身更简单，具有可判定的空性，无限性和不相交性。商店语言是显示这些属性的关键。
英文摘要：
The store language of a machine of some arbitrary type is the set of all store configurations (state plus store contents but not the input) that can appear in an accepting computation. New algorithms and characterizations of store languages are obtained, such as the result that any nondeterministic pushdown automaton augmented with reversal-bounded counters, where the pushdown can "flip" its contents up to a bounded number of times, can be accepted by a machine with only reversal-bounded counters. Then, connections are made between store languages and several model checking and reachability problems, such as accepting the set of all predecessor and successor configurations from a given set of configurations, and determining whether there are at least one, or infinitely many, common configurations between accepting computations of two machines. These are explored for a variety of different machine models often containing multiple parallel data stores. Many of the machine models studied can accept the set of predecessor configurations (of a regular set of configurations), the set of successor configurations, and the set of common configurations between two machines, with a machine model that is simpler than itself, with a decidable emptiness, infiniteness, and disjointness property. Store languages are key to showing these properties.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
