1. Nigmatullin, R.: Complexity of Boolean Functions, Moscow (1986) (in Russian)
2. Barzdins, J., Trakhtenbrot, B.: Finite Automata. Behavior and Synthesis, Moscow (1970) (in Russian)
3. Boppana, R.B.: The complexity of Finite Functions, New York (1989)
4. Straubing, H.: Automata, Formal Logic and Circuit Complexity. Birkhäuser, Basel (1994)
5. Savage, J.E.: Models of Computation: Exploring the Power of Computing. Addison Wesley, Reading (1998)