Book:Books/Computer Science

The following books covered on $\mathsf{Pr} \infty \mathsf{fWiki}$ discuss computer science.

For a comprehensive list of books referenced on $\mathsf{Pr} \infty \mathsf{fWiki}$ (and more), see Books.

Books

• 1954: A.A. Markov Jr.: Teoriya Algorifmov
  • 1984: A.A. Markov Jr. and N.M. Nagorny: Teoriya Algorifmov (Revised and Enlarged ed.)
  • 1988: A.A. Markov Jr. and N.M. Nagorny: The Theory of Algorithms (translated by M. Greendlinger)

• 1968: John E. Hopcroft and Jeffrey D. Ullman: Formal Languages and Their Relation to Automata

• 1979: John E. Hopcroft and Jeffrey D. Ullman: Introduction to Automata Theory, Languages, and Computation
  • 2000: John E. Hopcroft and Jeffrey D. Ullman: Introduction to Automata Theory, Languages, and Computation (2nd ed.)
  • 2006: John E. Hopcroft, Rajeev Motwani and Jeffrey D. Ullman: Introduction to Automata Theory, Languages, and Computation (3rd ed.)

• 1980: N.J. Cutland: Computability: An Introduction to Recursive Function Theory
• 1981: William F. Clocksin and Christopher S. Mellish: Programming in Prolog
• 1988: D.C. Ince: An Introduction to Discrete Mathematics and Formal System Specification

• 1990: Thomas H. Cormen, Charles E. Leiserson and Ronald L. Rivest: Introduction to Algorithms
  • 2001: Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Cliff Stein: Introduction to Algorithms (2nd ed.)
  • 2009: Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Cliff Stein: Introduction to Algorithms (3rd ed.)

• 1993: A.K. Dewdney: The New Turing Omnibus: Sixty-Six Excursions in Computer Science
• 1995: Bruce W. Watson: Taxonomies and Toolkits of Regular Language Algorithms
• 1995: Douglas Hofstadter: Fluid Concepts and Creative Analogies
• 1999: Donald L. Kreher and Douglas R. Stinson: Combinatorial Algorithms: Generation, Enumeration, and Search