Written to address the fundamentals of formal languages, automata, and computabilty, An Introduction to Formal Languages and Automata provides an accessible, student-friendly presentation of all material essential to an introductory Theory of Computation course. It is designed to familiarize students with the foundations and principles of computer science and to strengthen the students' ability to carry out formal and rigorous mathematical arguments. In the new Fifth Edition, Peter Linz continues to offer a straightforward, uncomplicated treatment of formal languages and automata and avoids excessive mathematical detail so that students may focus on and understand the underlying principles. In an effort to further the accessibility and comprehension of the text, the author has added new illustrative examples and exercises throughout. There is a substantial amount of new material in the form of 2 new appendices, and a CD of JFLAP exercises authored by Susan Rodger of Duke University. The first appendix is an entire chapter on finite-state transducers because it is an important, related area of computer science such as digital design. This optional chapter can be used to prepare for further related study. There is similarity with the finite accepters presented early in this fifth edition so this new chapter will be well-received. The second appendix offers a brief introduction to JFLAP; an interactive software tool that is of great help in both learning the material and in teaching the course. JFLAP implements most of the ideas and constructions in this fifth edition. It not only helps students to visualize abstract concepts, it is a great time-saver. Many of the exercises in the text require creating structures that are complicated and that have to be thoroughly tested for correctness. JFLAP can reduce the time required for this by an order of magnitude. The CD that comes with the fifth edition expands this and offers exercises specific for JFLAP.