An Introduction to Formal Languages and Automata: .

by Peter Linz

An Introduction to Formal Languages and Automata, Sixth Edition provides an accessible, student-friendly presentation of all material essential to an introductory Theory of Computation course. Written to address the fundamentals of formal languages, automata, and computability, the text 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. The author, Peter Linz, continues to offer a straightforward, uncomplicated treatment of formal languages and automata and avoids excessive mathematical detail allowing students to focus on and understand the key underlying principles. New & Key • An accessible approach allows students to clearly understand key content while retaining the appropriate mathematical notations and theorems required for the course • New Chapter Synopsis, found at the end of each chapter, recap important concepts found in the text • Every major idea is preceded by a motivating example, drawn from applications, that introduces the concept and illustrates its usefulness • The exercise section has been restructured and improved with accessible exercises more closely tied to examples in the text • An enhanced Instructor's Manual includes more detailed solutions to problems found in the text

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

450 pages, Hardcover

First published June 1, 1990

Reviews

[Gita]

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

[Monireh Ghadirain]

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

[Saman Nourkhalaj]

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

[Behdad Ahmadi]

عالی!

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

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

[0r2b80]

this term was fun just because of you Peter Linz

[Alexandru Croitor]

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]

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

[mohsen]

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]

Good book for knowing Automata , but very limited example .

[Manan Singh]

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]

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]

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]

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

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

[An Vo]

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

[Joseph]

Explanations were great, overall lack of explanations for examples or good examples in general

[Cynbel]

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]

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]

adadadadadad

[Nazanin]

عالی