What do you think?
Rate this book
An Introduction to Formal Languages and Automata
An Introduction to Formal Languages and Automata, Sixth Edition, provides an accessible, student-friendly presentation of all the material essential to an introductory Theory of Computation course. Written to address the fundamentals of formal languages, automata, and computability, the text is designes 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 and Key Features of the Sixth Edition: An accesible approach allows students to clearly understand key content while retaining the appropriate mathematical notations and theorems requrired for the course New Chapter Synopses, found at the beginning 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 New Exercises added throughout are more closely tied to examples in the text An enchanced Instructor's Manual includes more detailes solutions to all problems found in the text
450 pages, Unknown Binding
First published June 1, 1990
36 people are currently reading
380 people want to read
Ratings & Reviews
Friends & Following
Create a free account to discover what your friends think of this book!
Community Reviews
Displaying 1 - 20 of 20 reviews
January 31, 2024
فردا باید پروژه� رو بارگذاری کنم، شنبه ارائه‌ا� بدم، و دیگه این درس تمومه.
علوم‌کامپیوتری‌تری� درسی بود که تا حالا گذرونده بودم و خیلی خیلی دوستش داشتم. یک عالمه زبان ساختیم و اونها رو تحلیل کردیم، براشون گرامر نوشتیم، و در نهایت یاد گرفتیم ماشین‌ها� تورینگی بنویسیم که زبانِ گرامرهامون رو پذیرش کنه. آخ خیلی خوش گذشت.
کتاب پیتر لینز هم برام خوش‌خوا� بود. توضیحاتش واضح بود و به اندازه� کافی تمرین حل‌شد� داشت.
۰۲/۱۱/۴
علوم‌کامپیوتری‌تری� درسی بود که تا حالا گذرونده بودم و خیلی خیلی دوستش داشتم. یک عالمه زبان ساختیم و اونها رو تحلیل کردیم، براشون گرامر نوشتیم، و در نهایت یاد گرفتیم ماشین‌ها� تورینگی بنویسیم که زبانِ گرامرهامون رو پذیرش کنه. آخ خیلی خوش گذشت.
کتاب پیتر لینز هم برام خوش‌خوا� بود. توضیحاتش واضح بود و به اندازه� کافی تمرین حل‌شد� داشت.
۰۲/۱۱/۴
November 15, 2013
کتاب (خود کتاب، نه ترجمه) بسیار روان برای یادگیری نظریه زیان ها و ماشین ها با تمرینات مناسب.
البته کتاب در مبحث گرامرها و همچنین پیچدگی جامع نیست و باید در کنار کتاب های دیگر مطالعه شود. ولی برای کسانی که برای اولین بار میخواهند نظریه زبان ها را یاد بگیرند همین کتاب را توصیه می کنم
البته کتاب در مبحث گرامرها و همچنین پیچدگی جامع نیست و باید در کنار کتاب های دیگر مطالعه شود. ولی برای کسانی که برای اولین بار میخواهند نظریه زبان ها را یاد بگیرند همین کتاب را توصیه می کنم
October 5, 2017
بهترین و بهترین و بهترین کتاب یادگیری نظریه� زبان وماشینه. مثال‌ه� و تمرین‌ها� فوق‌العاد� و مطالب رو کاملا عمقی توضیح می‌د�. به نظرم بهترین رفرنس ممکن برای شروع این فیلده.
January 7, 2016
عالی!
درباره� نظریه زبان‌ه� و ماشین‌هاست� و با خوندنش می‌فهمی� کامپایلر چطور متوجه خطای سینتکسی میشه. :دی
متن خیلی روون و خوب، موضوع جذاب، ترتیب مناسب مباحث و همه چیز.
کتاب دلنشین و کاملیه.
درباره� نظریه زبان‌ه� و ماشین‌هاست� و با خوندنش می‌فهمی� کامپایلر چطور متوجه خطای سینتکسی میشه. :دی
متن خیلی روون و خوب، موضوع جذاب، ترتیب مناسب مباحث و همه چیز.
کتاب دلنشین و کاملیه.
December 30, 2023
this term was fun just because of you Peter Linz
February 23, 2024
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.
February 22, 2007
this book translated to farsi with Dr. SarrafZadeh and his student's in teacher training university
December 5, 2007
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.
I teach it by a book which belongs to "Ker I Ko, D. Zoo" Problem solving in Automata, Language and Complexity Theory.
January 21, 2010
Good book for knowing Automata , but very limited example .
July 25, 2019
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.
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.
August 19, 2018
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.
May 13, 2017
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.
May 25, 2018
This book is not good some proofs in book are not accurate. other resources like Sipser are definitely better.
کتاب خوبی نیست تو ایران اکثرا از این استفاده می کنن شاید چون منابع دیگه چندان ترجمه نشده اما بقیه منابع مثل سیپسر بهترن.
کتاب خوبی نیست تو ایران اکثرا از این استفاده می کنن شاید چون منابع دیگه چندان ترجمه نشده اما بقیه منابع مثل سیپسر بهترن.
Read
January 7, 2021A: 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
B: Yeahhh
A: How do we know when it will be done?
B: idk
May 27, 2016
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.
January 17, 2015
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.
Read
April 3, 2016sgvsd
June 1, 2016
adadadadadad
Read
December 26, 2012عالی
Displaying 1 - 20 of 20 reviews
Can't find what you're looking for?
Get help and learn more about the design.