1. Ambainis, A., Watrous, J.: Two-way finite automata with quantum and classical states. Theor. Comput. Sci. 287(1), 299–311 (2002)
2. Ambainis, A., Yakaryılmaz, A.: Automata: from mathematics to applications. Technical Report. arXiv:1507.01988 (2015). to appear in Automata and Quantum Computing edited by Jean-Èric Pin
3. Babai, L.: Trading group theory for randomness. In: STOC 1985, pp. 421–429 (1985)
4. Lecture Notes in Computer Science;P Berman,1978
5. Condon, A.: The complexity of space bounded interactive proof systems. In: Complexity Theory: Current Research, pp. 147–190. Cambridge University Press, Cambridge (1993)