1. J. Kaneps, D. Geidmanis, R. Freivalds: Tally languages accepted by Monte Carlo pushdown automata. In: RANDOM’ 97, Lexture Notes in Computer Science 1269, pp. 187–195.
2. A.V. Aho, J.E. Hopcroft, and M. Yannakakis, “On notions of information transfer in VLSI circuits”, Proc. 15th Annual ACM STOCS, ACM 1983, pp. 133–139.
3. L. Babai, “Monte Carlo algorithms in graph isomorphism techniques”, Research Report no. 79-10, Département de mathématiques et statistique, Université de Montréal, 1979.
4. Duriš, P., Hromkovič, J., Inone, K.: A separation of determinism, Las Vegas and nondeterminism for picture recognition. In: Proc. IEEE Conference on Computational Complexity, IEEE 2000, pp. 214–228. Full Version: Electronic Colloqium on Computational Complexity, Report No. 27 (2000).
5. Lect Notes Comput Sci;P. Ďuriš,1997