1. Shannon, C., A Report about the Machine Solving the Maze Problem, in Raboty po teorii informatsii i kibernetike (The Works on the Theory of Information and Cybernetics), Moscow: Inostrannaya Literatura, 1963.
2. Kudryavtsev, V.B., Ushchumlich, Sh., and Kilibarda, G., The Bahavior of Automata in Mazes, Diskret. Mat., 1992, vol. 4, no. 3, pp. 3–28.
3. Bhatt, S., Even, S., Greenberg, D., and Tayar, R., Traversing Directed Eulerian Mazes, J. Graph Algorithms App., 2002, vol. 6, no. 2, pp. 157–173 ( http://www.cs.brown.edu/publications/jgaa/accepted/2002/Bhatt+2002.6.2.pdf ).
4. Lallement, G., Semigroups and Combinatorial Applications, New York: Wiley, 1979. Translated under the title Polugruppy i kombinatornye prilozheniya, Moscow: Mir, 1985, pp. 251–263.
5. Mirkin, B.G., Problema gruppovogo vybora (The Cluster Sampling Problem), Moscow: Nauka, 1974, pp. 93–95.