An Introduction to Formal Languages and Automata

An Introduction to Formal Languages and Automata

2.0 1
by Peter Linz

View All Available Formats & Editions

Editorial Reviews

Formal languages, automata, computability, and related matters form the major part of the theory of computation. This textbook is designed for an introductory course for computer science and computer engineering majors who have knowledge of some higher-level programming language, the fundamentals of data structures and algorithms, and discrete mathematics (including set theory, functions, relations, logic, and mathematical reasoning). Linz (U. of California, Davis) gives the motivation for proofs rather than their mathematical detail, focusing rather on the underlying principles as illustrated by examples. A sampling of topics covered includes finite and pushdown automata, regular and context-free languages and grammars, turing machines, and algorithmic and other models of computation. Annotation c. Book News, Inc., Portland, OR (

Product Details

Jones & Barlett Learning
Publication date:
Theory of Computation Series
Edition description:
Older Edition
Product dimensions:
7.74(w) x 9.54(h) x 1.02(d)

Meet the Author

Customer Reviews

Average Review:

Write a Review

and post it to your social network


Most Helpful Customer Reviews

See all customer reviews >

An Introduction to Formal Languages and Automata 2 out of 5 based on 0 ratings. 1 reviews.
Guest More than 1 year ago
How this book was written is confusing. I am taking it in a class and usually when the teacher baffles me I turn to the book and learn by examples. The examples skip steps and are confusing with abstract symbols. Hardly any of the exercises follow the examples. On top of it all, the author is so triumphant about how an example is solved so easily that he never looks back to see all the other readers tripped and fallen. I have taken C++, Java, VB and discrete math and I still can't grasp how to understand this book. I finally got fed up and thought I would warn others. Caution: Stay away from the Pumping Lemma chapter.