An Introduction To Formal Languages And Automata

by Peter Linz

An Introduction to Formal Languages and Automata, Fourth Edition provides an excellent presentation of the material that is essential to an introductory theory of computation course. This fourth edition offers expanded and simplified discussions of some of the more difficult ideas and constructions that often frustrate students. The author offers an intuitive motivation for proofs, and avoids excessive mathematical detail, so that students can focus on and understand the underlying detail. New end-of-chapter exercises, varying in degree of difficulty, are designed to illuminate and illustrate key concepts and call on students' problem-solving ability.Key FeaturesNew to this Edition:Expanded and simplified discussions of some of the more difficult ideas and constructions such as the pumping lemmas, the "finite automata to regular expression" construction, and the "pushdown to context-free grammar" algorithmNew examples that clearly illustrate the above conceptsAn introduction of transition graphs for pushdown automata and Turing machinesChapter 14 has been expanded, making it suitable for a one or one and a half week discussion of computational complexityNew and revised exercises throughoutInstructor's guide with solutions manual and instructor's website availableTable of ContentsIntroduction to the Theory of ComputationFinite AutomataRegular Languages and Regular GrammarsProperties of Regular LanguagesContext-Free LanguagesSimplification of Context-Free Grammars and Normal FormsPushdown AutomataProperties of Context-free LanguagesTuring MachinesOther Models of Turing MachinesA Hierarchy of Formal Languages and AutomataLimits of Algorithmic ComputationOther Models of ComputationAn Overview of Computational ComplexityAnswersReferencesIndex.

Genres: Computer Science, Mathematics, Textbooks, Reference, Technical, Nonfiction, Science

430 pages, Paperback

First published June 1, 1990

Reviews

[Gita · Rating 4 out of 5]

فردا باید پروژه‌م رو بارگذاری کنم، شنبه ارائه‌اش بدم، و دیگه این درس تمومه.
علوم‌کامپیوتری‌ترین درسی بود که تا حالا گذرونده بودم و خیلی خیلی دوستش داشتم. یک عالمه زبان ساختیم و اونها رو تحلیل کردیم، براشون گرامر نوشتیم، و در نهایت یاد گرفتیم ماشین‌های تورینگی بنویسیم که زبانِ گرامرهامون رو پذیرش کنه. آخ خیلی خوش گذشت.
کتاب پیتر لینز هم برام خوش‌خوان بود. توضیحاتش واضح بود و به اندازه‌ی کافی تمرین حل‌شده داشت.
۰۲/۱۱/۴

[Monireh Ghadirain · Rating 4 out of 5]

کتاب (خود کتاب، نه ترجمه) بسیار روان برای یادگیری نظریه زیان ها و ماشین ها با تمرینات مناسب.
البته کتاب در مبحث گرامرها و همچنین پیچدگی جامع نیست و باید در کنار کتاب های دیگر مطالعه شود. ولی برای کسانی که برای اولین بار میخواهند نظریه زبان ها را یاد بگیرند همین کتاب را توصیه می کنم

[Saman Nourkhalaj · Rating 5 out of 5]

بهترین و بهترین و بهترین کتاب یادگیری نظریه‌ی زبان وماشینه. مثال‌ها و تمرین‌هاش فوق‌العادن و مطالب رو کاملا عمقی توضیح می‌ده. به نظرم بهترین رفرنس ممکن برای شروع این فیلده.

[Behdad Ahmadi · Rating 5 out of 5]

عالی!

درباره‌ی نظریه زبان‌ها و ماشین‌هاست، و با خوندنش می‌فهمید کامپایلر چطور متوجه خطای سینتکسی میشه. :دی
متن خیلی روون و خوب، موضوع جذاب، ترتیب مناسب مباحث و همه چیز.

کتاب دلنشین و کاملیه.

[0r2b80 · Rating 4 out of 5]

this term was fun just because of you Peter Linz

[Alexandru Croitor · Rating 5 out of 5]

It helped me through my "Formal Languages & Compiler Design" class (first part, obv.). I've used it to supplement my lecture notes. There are plenty of useful "worked-through" examples.

[mohsenmomeni momeni · Rating 2 out of 5]

this book translated to farsi with Dr. SarrafZadeh and his student's in teacher training university

[mohsen · Rating 2 out of 5]

This course could be read by some better references.
I teach it by a book which belongs to "Ker I Ko, D. Zoo" Problem solving in Automata, Language and Complexity Theory.

[hossein Sh · Rating 4 out of 5]

Good book for knowing Automata , but very limited example .

[Manan Singh · Rating 5 out of 5]

Very well written.
Before reading it I was afraid of my math incompetence, but this is one of those rare books which also gave all the required math (about sets and functions mainly).
Also, I found a very nice flow in the writer's style which is many times absent in textbooks. The prose flowed like a story from beginning to end.
The author had remarkable clarity about whatever he writes, even though his writing style is plain and simple.
Exemplary textbook.
Best book for Theory of Computation Courses.

[Ruben Steins · Rating 4 out of 5]

Rigorous introduction to the topic. While the final chapters really touch on more advanced topics I found hard to follow, the first half of the book is pretty accessible. The extensive sets of exercises make it a very suitable textbook for a course on the subject of grammars, automata and formal languages.

[Andrew Obrigewitsch · Rating 3 out of 5]

This book does a decent job in explaining Formal Languages and Automata. However, I didn't like the super formal approach for the more difficult subjects such as the Turing machine and pumping lemma. I had to use external sources to figure those two subjects out.

[Kamal · Rating 3 out of 5]

This book is not good some proofs in book are not accurate. other resources like Sipser are definitely better.

کتاب خوبی نیست تو ایران اکثرا از این استفاده می کنن شاید چون منابع دیگه چندان ترجمه نشده اما بقیه منابع مثل سیپسر بهترن.

[An Vo · Rating 3 out of 5]

Meh

[Jack Kilgore]

A: You mean a Turing machine can do all this for me?

B: Yeahhh

A: How do we know when it will be done?

B: idk

[Cynbel · Rating 3 out of 5]

Not terrible but definitely not an easy book on the subject, the author could have been a bit more descriptive and given more complex examples because typically he gives very easy examples and then none of the problems are simple and can be pretty difficult.

[Khalil Al Nokhatha · Rating 2 out of 5]

The book is not bad, rich of exercises. The only problem is that it solves basic and easy examples only. Which makes harder for the reader to be able to apply the concept on hard exercises.

[Arian Farsi]

sgvsd

[Ahmadrezashams · Rating 5 out of 5]

adadadadadad

[Nazanin]

عالی