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