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