1.
Garey, M.R., Johnson, D.S.: Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman, New York (1979).
2.
Rayward-Smith, V.J.: A first course in computability. Blackwell Scientific, Oxford (1986).
3.
Harry R. Lewis: Elements of the theory of computation. Prentice-Hall, Upper Saddle River, N.J (1998).
4.
Sipser, M.: Introduction to the theory of computation. Cengage Learning, Australia (2013).
5.
Hopcroft, John.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Pearson Education (2003).