## CS 3133, A Term 1998, Professor Alvarez

References

#### Text

- T.A. Sudkamp,
*Languages and Machines* (2nd edition),
Addison-Wesley, 1997

You'll need the textbook. If you have time/money/desire for a single
supplementary reference, I'd recommend getting the book by Sipser
(see below). It's quite good and has been used recently as the
textbook in CS 4123, which is a continuation of CS 3133.

#### Recommended supplementary reference

- M. Sipser,
*Introduction to the Theory of Computation*,
PWS Publishing Company, 1997

#### Additional references

- J.E. Hopcroft, J.D. Ullman,
*Introduction to Automata Theory, Languages and Computation*,
Addison-Wesley, 1979
- H.R. Lewis, C.H. Papadimitriou,
*Elements of the Theory of Computation* (2nd edition),
Prentice-Hall, 1998

#### Advanced references

- A.V. Aho, R. Sethi, J.D. Ullman,
*Compilers: Principles, Techniques, and Tools*,
Addison-Wesley, 1986
- M.A. Harrison,
*Introduction to Formal Language Theory*,
Addison-Wesley, 1978
- C.H. Papadimitriou,
*Computational Complexity*,
Addison-Wesley, 1994

#### References for background material

- T.H. Cormen, C.E. Leiserson, R.L. Rivest,
*Introduction to Algorithms*,
MIT Press, 1990
- R.L. Graham, D.E. Knuth, O. Patashnik,
*Concrete Mathematics* (2nd edition),
Addison-Wesley, 1994
- P. Halmos,
*Naive Set Theory*,
Springer-Verlag, 1987

#### Some of the true classics (for the truly brave)

- N. Chomsky, "Three models for the description of languages",
*IRE Transactions on Information Theory*, 2 (1956), no. 3, 113-124
- S.A. Cook, "The complexity of theorem-proving procedures",
*Proceedings of the Third Annual ACM Symposium on the Theory
of Computing*, ACM (1971), 151-158
- J. Hartmanis, R.E. Stearns, "On the computational complexity
of algorithms",
*Transactions of the American Mathematical Society*,
117 (1965), 285-305
- E.L. Post, "Finite combinatory processes: formulation I",
*Journal of Symbolic Logic*, 1 (1936), 103-105
- C.E. Shannon, J. McCarthy (editors),
*Automata Studies*,
Princeton University Press, 1956
- A.M. Turing, "On computable numbers, with an application
to the Entscheidungsproblem.
*Proceedings of the London
Mathematical Society*, 2 (1936), no. 42, 230-265; no. 43, 544-546