Shallit J. A Second Course in Formal Languages and Automata Theory 2008

Textbook in PDF format

Intended for graduate students and advanced undergraduates in computer science, A Second Course in Formal Languages and Automata Theory treats topics in the theory of computation not usually covered in a first course.
After a review of basic concepts, the book covers combinatorics on words, regular languages, context-free languages, parsing and recognition, Turing machines, and other language classes. Many topics often absent from other textbooks, such as repetitions in words, state complexity, the interchange lemma, 2DPDAs, and the incompressibility method, are covered here. The author places particular emphasis on the resources needed to represent certain languages. The book also includes a diverse collection of more than 200 exercises, suggestions for term projects, and research problems that remain open. Jeffrey Shallit is professor in the David R. Cheriton School of Computer Science at the University of Waterloo. He is the author of Algorithmic Number Theory (coauthored with Eric Bach) and Automatic Sequences: Theory, Applications, Generalizations (coauthored with Jean-Paul Allouche). He has published approximately 90 articles on number theory, algebra, automata theory, complexity theory, and the history of mathematics and computing.
Review of formal languages and automata theory
Combinatorics on words
Finite automata and regular languages
Context-free grammars and languages
Parsing and recognition
Turing machines
Other language classes