Liu C.L. Elements of Discrete Mathematics

McGraw-Hill College, 1985. — 448 p. — 2nd Sub edition — (McGraw-Hill Computer Science Series). — ISBN: 007038133X, 9780070381339The second edition retains almost all the material in the first edition and includes three new chapters, namely, Chapter 2: Computability and Formal Languages, Chapter 7: Finite State Machines, and Chapter 8: Analysis of Algorithms, as well as several new sections on discrete probability, asymptotic behavior of functions, and recursive algorithms. I hope the new material will help to further illustrate the relevance of the mathematics we try to teach and give the reader a glimpse of a number of upper-class courses in a Computer Science or Mathematics curriculum such as Analysis of Algorithms, Automata Theory, Formal Languages, and Probability Theory, which he or she might wish to take after having the material in this book. (Clearly, courses such as Combinatorial Mathematics, Graph Theory, and Abstract Algebra are natural follow-ups even without the new material in this edition.)