An Introduction to Formal Languages and Automata 5th Edition Hardback

Description

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.

CONTENTS:

Chapter 1 Introduction to the Theory of Computing

Chapter 2 Finite Automata

Chapter 3 Regular Languages and Regular Grammars

Chapter 4 Properties of Regular Languages

Chapter 5 Context-Free Languages

Chapter 6 Simplifications 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