1. Barrington, D., McKenzie, P., Moore, C., Tesson, P., and Thérien, D.2000, Equation satisfiability and program satisfiability for finite monoids, inProceedings of the 25th International Symposium on Mathematical Foundations of Computer Science, Slovak Republic, pp. 172–181.
2. Barrington, D. A. 1986, Bounded-Width Branching Programs, Ph.D. thesis, Massachusetts Institute of Technology.
3. Non-uniform automata over groups;Barrington;Inform. and Comput.,1990
4. Engebretsen, L, Holmerin, J, and, Russell, A. 2002, Inapproximability results for equations over finite groups, in, Proceedings of the 29th International Colloquium on Automata, Languages, and Programming, Málaga, Spain.
5. Goldmann, M., and Russell, A.1999, The computational complexity of solving systems of equations over finite groups, inProceedings of the Fourteenth Annual IEEE Conference on Computational Complexity, Atlanta, GA, pp. 80–86.