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.
[KNP07] Marta Kwiatkowska, Gethin Norman, and David Parker
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2025 2verdicts
UNVERDICTED 2representative citing papers
Model-checking stateless quantum pushdown systems against PCTL is undecidable while against bPCTL it is decidable and NP-hard.
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.
-
Computational Complexity of Model-Checking Quantum Pushdown Systems
Model-checking stateless quantum pushdown systems against PCTL is undecidable while against bPCTL it is decidable and NP-hard.