Automata, Computability, and Complexity: Theory and Applications by Elaine Rich
  1. Adleman, Leonard, "Molecular Computation of Solutions to Combinatorial Problems", 1994.
  2. Adleman, Leonard, "Computing with DNA", 1998.
  3. Agrawal, Kayal and Saxena, "PRIMES is in P", 2004.
  4. Altschuler, "Basic local alignment search tool", 1990.
  5. Anderson, John et al., "An integrated theory of the mind", 2004.
  6. Backus, John, "Programming in America in the 1950s Some personal impressions",
  7. Bentley, Jon, Programming Pearls, Second Edition, 2000.
  8. Berners-Lee and Noah Mendelsohn, The Rule of Least Power, 2006.
  9. Bryant, Randal, "Graph-based algorithms for Boolean function manipulation", 1986.
  10. Bryant, Randal, "Symbolic Boolean manipulation with ordered binary decision diagrams", 1992.
  11. Copeland and Haemer, Nonsense, 2001.
  12. Dijkstra, Edsger, EWD-1248.
  13. Earley, Jay, An Efficient Context-Free Parsing Algorithm, 1970.
  14. Gardner, Martin, Mathematical Games, 1970.
  15. Gödel, Kurt, "On Formally Undecidable Propositions in Principia Mathematica and Related Systems I", originally published in German in 1931. This translation by Martin Hirzel published in 2000.
  16. Harel, David, "Statecharts: A visual formulation for complex systems", 1987.
  17. Herbison-Evans, "A revised grammar for the foxtrot", 2006
  18. Immerman, Neil, "Nondeterministic space is closed under complementation", 1988.
  19. Johnson, Stephen, Yacc: Yet Another Compiler-Compiler, 1979.
  20. Jurafsky and Martin,Speech and Language Processing: An Introduction to Natural Language Processing, Computational Linguistics, and Speech Recognition, 2000.
  21. Karttunen, Laurie and Kenneth Beesley, "A short history of two-level morphology", 2001.
  22. Lagarias, Jeff, "The 3x+1 problem and its generalizations", 1985.
  23. Lee, Lillian, Fast Context-Free Parsing Requires Fast Boolean Matrix Multiplication, 2002
  24. Lesk and Schmidt, Lex A Lexical Analyzer Generator, 1979.
  25. Manning and Schütze, Foundations of Statistical Natural Language Processing, 1999.
  26. McCarthy, Recursive Functions of Symbolic Expressions and Their Computation by Machine, 1960.
  27. Misra, Jay, "Coloring grid points, without rabbits or snakes", 1996.
  28. Misra, Jay, Theory in Programming Practice, 2004.
  29. Nardi, Daniele and Ronald J. Brachman, "An Introduction to Description Logics", 2003.
  30. Ochoa, Gabriela, An Introduction to Lindenmayer Systems, 1998.
  31. Prusinkiewicz, Przemyslaw and Aristid Lindenmayer, The Algorithmic Beauty of Plants, 1990
  32. Rabiner, L, "A tutorial on hidden Markov models and selected applications in speech recognition", 1989
  33. Rendell, Paul, This is a Turing Machine Implemented in Conway's Game of Life, 2000.
  34. RFC 793, Postel, J., "Transmission Control Protocol", 1981.
  35. Roggenbach, Markus, "Determinization of Büchi automata", 2002.
  36. Shannon, Claude E, "A mathematical theory of communication", 1948.
  37. Sokol, Joel, "An intuitive Markov chain model from baseball", 2004.
  38. Searle, John, "Minds, brains, and programs", 1980.
  39. Shor, Peter, "Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer", .
  40. Stone, Peter, et al., "UT Austin Villa 2003: A New RoboCup Four-Legged Team", 2003.
  41. Turing, Alan, "On computable numbers, with an application to the Entscheidungsproblem", 1937.
  42. Turing, Alan, "Computing machinery and intelligence", 1950.
  43. Wolfram, Stephen, A New Kind of Science, 2002.