We study the computational capacity of self-verifying iterative arrays (\({\text {SVIA}}\)). A self-verifying device is a nondeterministic device whose nondeterminism is symmetric in the following sense. Each computation path can give one of the answers yes, no, or do not know. For every input word, at least one computation path must give either the answer yes or no, and the answers given must not be contradictory. It turns out that, for any time-computable time complexity, the family of languages accepted by \({\text {SVIA}}\)s is a characterization of the so-called complementation kernel of nondeterministic iterative array languages, that is, languages accepted by such devices whose complementation is also accepted by such devices. \({\text {SVIA}}\)s can be sped-up by any constant multiplicative factor as long as the result does not fall below realtime. We show that even realtime \({\text {SVIA}}\) are as powerful as lineartime self-verifying cellular automata and vice versa. So they are strictly more powerful than the deterministic devices. Closure properties and various decidability problems are considered.

我们研究了自验证迭代数组（\（{\ text {SVIA}} \））的计算能力。自验证设备是一种不确定设备，其不确定性在以下意义上是对称的。每个计算路径都可以给出是，否或不知道的答案之一。对于每个输入单词，至少一个计算路径必须给出答案yes或no，并且给出的答案不得矛盾。事实证明，对于任何时间复杂的时间复杂度，\（{\ text {SVIA}} \）接受的语言族s是非确定性迭代数组语言的所谓补充内核的特征，即，被此类设备接受的语言，其补充也被此类设备接受。只要结果不低于实时值，就可以通过任何恒定的乘法因子来加快\（{\ text {SVIA}} \）。我们证明，甚至实时\（{\ text {SVIA}} \）都与线性时间自验证细胞自动机一样强大，反之亦然。因此，它们严格比确定性设备强大。考虑了封闭性和各种可判定性问题。