Affine automata with only rational entries retain the ability to verify benchmark nonregular languages and provide weak verification for all Turing-recognizable languages plus strong verification for ATIME(2^O(n)) and PSPACE languages in Arthur-Merlin systems.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.FL 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Rational-Valued Affine Verifiers in Arthur--Merlin Proof Systems
Affine automata with only rational entries retain the ability to verify benchmark nonregular languages and provide weak verification for all Turing-recognizable languages plus strong verification for ATIME(2^O(n)) and PSPACE languages in Arthur-Merlin systems.