Librería Portfolio

The Sixth Edition of An Introduction to Formal Languages and Automata provides an accessible, student-friendly presentation of all material essential to an introductory Theory of Computation course. Written to address the fundamentals of formal languages, automata, and computability, the text 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. The author, 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.

New & Key Features:

Accessible approach allows students to clearly understand key content while retaining the appropriate mathematical notations and theorems required for the course
New Chapter Synopsis, found at the end of the chapter, recap important concepts found in the text
Every major idea is preceded by a motivating example, drawn from applications, that introduces the concept and illustrates its usefulness
The exercise section has been restructured and improved with accessible exercises more closely tied to the examples in the text
A new Instructor´s Manual includes more detailed solutions to problems found in the text
Applicable Courses
Written for the Theory of Computation course offered at 2- and 4-year colleges and universities.



Chapter 1 Introduction to the Theory of Computation
Chapter 2 Finite Automata
Chapter 3 Regular Languages and Regular Grammars
Chapter 4 Properties of Regular Languages
Chapter 5 Context-Free Languages
Chapter 6 Simplification of Context-Free Grammars and Normal Forms
Chapter 7 Pushdown Automata
Chapter 8 Properties of Context-Free Languages
Chapter 9 Turing Machines
Chapter 10 Other Models of Turing Machines
Chapter 11 A Hierarchy of Formal Languages and Automata
Chapter 12 Limits of Algorithmic Computation
Chapter 13 Other Models of Computation
Chapter 14 An Overview of Computational Complexity