关于非确定性计算的模型

摘要：

在本文中，我们考虑一个非确定性计算的确定性多头2路自动机具有只读访问的辅助存储器。内存包含额外的数据（猜测），如果对某些内存内容成功，则计算成功。此外，我们考虑的情况下，有限制的猜测，其中猜测应满足一些约束。我们表明，标准的复杂性类，如L，NL，P，NP，PSPACE可以根据这些模型的非确定性计算的特点。这些表征不同于众所周知的缺乏交替。

英文摘要：

In this paper we consider a nondeterministic computation by deterministic multi-head 2-way automata having a read-only access to an auxiliary memory. The memory contains additional data (a guess) and computation is successful iff it is successful for some memory content. Also we consider the case of restricted guesses in which a guess should satisfy some constraint. We show that the standard complexity classes such as L, NL, P, NP, PSPACE can be characterized in terms of these models of nondeterministic computation. These characterizations differ from the well-known ones by absence of alternation.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。