Introduction To Formal Languages And Automata / Edition 5

by Peter Linz

Overview

An Introduction to Formal Languages and Automata, Sixth Edition 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 allowing students to focus on and understand the key underlying principles.

New & Key Features:

• An 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 each 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 examples in the text
• An enhanced Instructor's Manual includes more detailed solutions to problems found in the text

Product Details

ISBN-13:	2901449615528
Publisher:	Jones & Bartlett Learning
Publication date:	02/14/2011
Edition description:	NE
Pages:	437
Product dimensions:	6.50(w) x 1.50(h) x 9.50(d)

About the Author

University of California, Davis, California

Table of Contents

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