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.
FREE Two-Day Shipping for Students. Learn more |
| ||||||||||||||||||
 Sell Back Your Copy for $15.91
Whether you buy it used on Amazon for $19.99 or somewhere else, you can sell it back through our Book Trade-In Program at the current price of $15.91.
Used Price$19.99
Trade-in Price$15.91
Price after
Trade-in$4.08 |
|
There is a newer edition of this item:
|
Book Description
Special Offers and Product Promotions
- Buy $50 in qualifying physical textbooks, get $5 in Amazon MP3 Credit. Here's how (restrictions apply)
Frequently Bought Together
Product Details
Would you like to update product info or give feedback on images?
|
More About the Author
Discover books, learn about writers, read author blogs, and more.
Customer Reviews
|
Share your thoughts with other customers:
|
||||||||||||||||||||||
|
Most Helpful Customer Reviews
6 of 7 people found the following review helpful:
5.0 out of 5 stars
Clear and Detailed, Excellent Textbook,
This review is from: An Introduction to Formal Language and Automata (Hardcover)
I am using this textbook for my Introduction to the Theory of Computation course this fall, and am very impressed with organization of the material and clarity of the explanations. Where other textbooks such as Sipser might spend one chapter, Linz expands the narrative to three or four, with clear steps of how all the pieces of automata theory and formal languages mesh. If you're interested in complexity theory, this text briefly covers P vs NP, but it is not the main focus. If you are interested in a text to prepare students for a course in the theory of programming languages, this is an excellent choice.
4.0 out of 5 stars
Required book for a computer science class,
Amazon Verified Purchase(What's this?)
This review is from: An Introduction to Formal Language and Automata (Hardcover)
This book is not to bad. The only problem I had is that the answers to question are not in your typical textbook fashion. The answers aren't based on odd problems but are haphazardly appear to be selected.
7 of 11 people found the following review helpful:
1.0 out of 5 stars
Not good at all unless you already know the subject matter.,
By
This review is from: An Introduction to Formal Language and Automata (Hardcover)
This is one of the worst text books that I have used. It gives large amounts of problems to solve, but provides few examples that adequately help the user to solve those problems. It makes references, in examples, to exercises that it assumes you have completed. It doesn't provide many answers to these exercises, either. I would estimate about 10%, and the exercises referred to by the text are usually not part of this 10%.
The book does not go into great detail in illustrating a point. I suppose it would be a good reference for someone who already understands the subject matter. For new students, this book is definitely not recommended.
Share your thoughts with other customers: Create your own review
|
|
Inside This Book
(learn more)
First Sentence:
The subject matter of this book, the theory of computation, includes several topics: automata theory, formal languages and grammars, computability, and complexity. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
generalized transition graph, describing regular languages, partial derivation tree, original dfa, membership algorithm, unrestricted grammar, linear bounded automaton, pumping lemma, useless productions, single final state, nonfinal state, equivalent dfa, linear bounded automata, sentential form, linear grammar, leftmost derivation, unary notation, minimal dfa, current input symbol, simulating machine, leftmost symbol, luring machine, recursive languages, final vertex, counter symbol Key Phrases - Capitalized Phrases (CAPs): (learn more)
Halting Problem Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
The subject matter of this book, the theory of computation, includes several topics: automata theory, formal languages and grammars, computability, and complexity. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
generalized transition graph, describing regular languages, partial derivation tree, original dfa, membership algorithm, unrestricted grammar, linear bounded automaton, pumping lemma, useless productions, single final state, nonfinal state, equivalent dfa, linear bounded automata, sentential form, linear grammar, leftmost derivation, unary notation, minimal dfa, current input symbol, simulating machine, leftmost symbol, luring machine, recursive languages, final vertex, counter symbol Key Phrases - Capitalized Phrases (CAPs): (learn more)
Halting Problem Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Citations (learn more)
What Other Items Do Customers Buy After Viewing This Item?
Tags Customers Associate with This Product(What's this?)Click on a tag to find related items, discussions, and people.
|
Sell a Digital Version of This Book in the Kindle Store
If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store.
Learn more
Customer Discussions
|
This product's forum
Active discussions in related forums
Search Customer Discussions
|
Related forums
|
Listmania!
|
|
