Web, Books, e-Reserves

The books listed here should be on reserve at Carlson Library. If they're not, sorry. Please tell me about it for next year but it may be too late to help this year. There are probably others in the stacks, or you could buy whatever you want.

There are book chapters and other goodies on the electronic reserves for 173.

Previous Version of Course

Formal Languages and Automata Theory

C Language

• KernighanRitchie
• 2
• 3
• 4
• C Programming
• Inspirational, Super-Cute...
• The Association of C and C++ Users maintains a very useful on-line compendium of reviews for books on C, Unix, and related topics.
• C: how to program (5th ed) Deitel and Deitel
• C for Programmers Burkhard
• C and UNIX: Tools for Software Design, by Martin L. Barrett and Clifford H. Wagner, John Wiley and Sons, 1996.
  This book contains a reasonable introduction to C and Unix, together, but it's not fantastic, and it's outrageously expensive, especially for a paperback. Not worth buying, but the library already owns a copy.
• The C Programming Language, by Brian W. Kernighan and Dennis M. Ritchie, Prentice Hall, 1988. The classic reference on C. Reasonably accessible, but many alternatives exist.
• Standard C: A Reference, by P. J. Plauger & Jim Brodie, Prentice Hall, 1996. An excellent reference. Thorough and very readable. May be out of print, however.
• Pointers on C, by Kenneth Reek, Addison-Wesley, 1998. An introduction to C that does a particularly nice job (as the title suggests) of covering the use of pointers, which are generally the hardest thing for Java programmers to understand. Has received excellent reviews. Written by a colleague at RIT.
• The UNIX Programming Environment, by Brian Kernighan and Rob Pike, Prentice Hall, 1984. The classic reference on Unix. Good, if dated. Many alternatives exist.

Scanning, Parsing

• reg. exp., finite automata, scanning notes 2006.
• reg. exp., finite automata, scanning overheads 2006 .
• context free grammar notes 2006.
• context free grammar overheads 2006 .

FLAT

• Blackboard Content FLAT From the CD accompanying Scott's textbook (see below).
• Ternary symbol, Two-State TM is Universal! Oct 24 2007: A proof made public today illustrates that Stephen Wolfram's 2,3 Turing machine number 596440 is a universal Turing machine, and it has netted a University of Birmingham undergraduate $25,000.
• 2 another course..some overheads for class. Mostly they use a text.
• Foundations of Computer Science, Aho and Ullman, previous 173 and 172 textbook, Chapters on Formal Languages and Automata (10 and 11).
• Programming Language Pragmatics Micahel Scott (2 copies). Good for scanning and parsing algorithms, CSC254 text. Also note the stuff on the CD that's pointed to above.
• , Kenneth Rosen. Lots of examples, seems a good one to own. Chapter 12 is scanned into e-reserves to complement the material from Scott on BB.
• Mathematical Structures for Computer Science , Judith Gersten. This is the source of the e-reserve scan, so all you need is available on RR e-reserves.
• Foundations of Computer Science, Aho and Ullman, previous 173 and 172 textbook. Chapters on Formal Languages and Automata Theory.
• Dexter C. Kozen, Automata and Computability, 1997, ISBN 0-387-94907-0, Springer Verlag.
• John E. Hopcroft and Jeffrey D. Ullman, Introduction to Automata Theory, Languages and Computation, 1979, Addison-Wesley. The chapter on LR parsing mentioned above is from this book.
• There is also 2nd revised edition (2001), by John E. Hopcroft, Rajeev Motwani and Jeffrey D. Ullman; it differs in scope and style (less formal).
• Finite Automata , Mark Lawson.