Abstract
We give a new characterization of NL as the class of languages whose members have certificates that can be verified with small error in polynomial time by finite state machines that use a constant number of random bits, as opposed to its conventional description in terms of deterministic logarithmic-space verifiers. It turns out that allowing two-way interaction with the prover does not change the class of verifiable languages, and that no polynomially bounded amount of randomness is useful for constant-memory computers when used as language recognizers, or public-coin verifiers.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Condon, A.: Computational Models of Games. MIT Press (1989)
Condon, A.: Space-bounded probabilistic game automata. Journal of the ACM 38(2), 472–494 (1991)
Condon, A.: The complexity of the max word problem and the power of one-way interactive proof systems. Computational Complexity 3(3), 292–305 (1993)
Condon, A.: The complexity of space bounded interactive proof systems. In: Complexity Theory: Current Research, pp. 147–190. Cambridge University Press (1993)
Condon, A., Ladner, R.: Interactive proof systems with polynomially bounded strategies. Journal of Computer and System Sciences 50(3), 506–518 (1995)
Condon, A., Lipton, R.J.: On the complexity of space bounded interactive proofs. In: Proceedings of the 30th Annual Symposium on Foundations of Computer Science. pp. 462–467 (1989), http://portal.acm.org/citation.cfm?id=1398514.1398732
Dwork, C., Stockmeyer, L.: A time complexity gap for two-way probabilistic finite-state automata. SIAM Journal on Computing 19(6), 1011–1123 (1990)
Dwork, C., Stockmeyer, L.: Finite state verifiers I: The power of interaction. Journal of the ACM 39(4), 800–828 (1992)
Freivalds, R.: Probabilistic two-way machines. In: Proceedings of the International Symposium on Mathematical Foundations of Computer Science, pp. 33–45 (1981)
Goldwasser, S., Sipser, M.: Private coins versus public coins in interactive proof systems. In: Proceedings of the 18th Annual ACM Symposium on Theory of Computing (STOC 1986), pp. 59–68 (1986)
Hartmanis, J.: On non-determinancy in simple computing devices. Acta Informatica 1, 336–344 (1972)
Holzer, M., Kutrib, M., Malcher, A.: Complexity of multi-head finite automata: Origins and directions. Theoretical Computer Science 412, 83–96 (2011)
Kaņeps, J.: Stochasticity of the languages acceptable by two-way finite probabilistic automata. Diskretnaya Matematika 1, 63–67 (1989) (Russian)
Kaņeps, J., Freivalds, R.: Running Time to Recognize Nonregular Languages by 2-Way Probabilistic Automata. In: Leach Albert, J., Monien, B., Rodríguez-Artalejo, M. (eds.) ICALP 1991. LNCS, vol. 510, pp. 174–185. Springer, Heidelberg (1991)
Macarie, I.I.: Space-efficient deterministic simulation of probabilistic automata. SIAM Journal on Computing 27(2), 448–465 (1998)
Shamir, A.: IP = PSPACE. Journal of the ACM 39(4), 869–877 (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Say, A.C.C., Yakaryılmaz, A. (2012). Finite State Verifiers with Constant Randomness. In: Cooper, S.B., Dawar, A., Löwe, B. (eds) How the World Computes. CiE 2012. Lecture Notes in Computer Science, vol 7318. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30870-3_65
Download citation
DOI: https://doi.org/10.1007/978-3-642-30870-3_65
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-30869-7
Online ISBN: 978-3-642-30870-3
eBook Packages: Computer ScienceComputer Science (R0)