An Introduction to Formal Languages and Automata

Front Cover
Jones & Bartlett Learning, 2006 - Computers - 415 pages
7 Reviews
Fully Revised, The New Fourth 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. The Text Was 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 Fourth Edition, Author Peter Linz Has Offered 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 Throughout.
 

What people are saying - Write a review

User ratings

5 stars
4
4 stars
3
3 stars
0
2 stars
0
1 star
0

User Review - Flag as inappropriate

good

User Review - Flag as inappropriate

Very nice book on Automata Theory. It explains the subject in a very nice way.

All 5 reviews »

Contents

Introduction to the Theory of Computation
1
Finite Automata
37
Regular Languages and Regular Grammars
71
Properties of Regular Languages
99
ContextFree Languages
125
Simplification of ContextFree Grammars and Normal
149
Pushdown Automata
175
Properties of ContextFree Languages
205
Other Models of Turing Machines
249
A Hierarchy of Formal Languages and Automata
275
Limits of Algorithmic Computation
297
Other Models of Computation
323
An Overview of Computational Complexity
343
Answers
363
References
409
Copyright

Turing Machines
221

Other editions - View all

Common terms and phrases

References to this book

All Book Search results »

Bibliographic information