1. M. Hall, Combinatorial Theory. Blaisdell, Waltham, Mass., 1967.
2. V. I. Nechaev, Elements of Cryptography. Foundations of Information Security.Vysshaya Shkola, Moscow, 1999 (in Russian).
3. Classes of languages and linear-bounded automata
4. M. R. Garey and D. S. Johnson, Computers and Intractability.A Guide to the Theory of NP-completeness. Freeman, San Francisco, 1979.
5. Splinters of recursive functions