仿射自动机验证器
Affine automata verifiers
摘要：
我们开始研究的验证能力的AFA的亚瑟-梅林（AM）证明系统的一部分。我们证明了每一个一元语言是由一个实值AfA验证。然后，我们专注于验证限制只有整数值或有理值的过渡。我们观察到有理数值验证者可以被整数值验证者模拟，并且它们的协议可以在非确定性多项式时间内模拟。我们表明，这个界紧提出了一个AFA验证NP完全问题SUBSETSUM。我们还表明，AfAs可以验证某些非仿射和非随机一元语言。
英文摘要：
We initiate the study of the verification power of AfAs as part of Arthur-Merlin (AM) proof systems. We show that every unary language is verified by a real-valued AfA verifier. Then, we focus on the verifiers restricted to have only integer-valued or rational-valued transitions. We observe that rational-valued verifiers can be simulated by integer-valued verifiers, and, their protocols can be simulated in nondeterministic polynomial time. We show that this bound tight by presenting an AfA verifier for NP-complete problem SUBSETSUM. We also show that AfAs can verify certain non-affine and non-stochastic unary languages.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
