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, he has added new illustrative examples throughout.
فردا باید پروژه� رو بارگذاری کنم، شنبه ارائها� بدم، و دیگه این درس تمومه. علومکامپیوتریتری� درسی بود که تا حالا گذرونده بودم و خیلی خیلی دوستش داشتم. یک عالمه زبان ساختیم و اونها رو تحلیل کردیم، براشون گرامر نوشتیم، و در نهایت یاد گرفتیم ماشینها� تورینگی بنویسیم که زبانِ گرامرهامون رو پذیرش کنه. آخ خیلی خوش گذشت. کتاب پیتر لینز هم برام خوشخوا� بود. توضیحاتش واضح بود و به اندازه� کافی تمرین حلشد� داشت. ۰۲/۱۱/۴
کتاب (خود کتاب، نه ترجمه) بسیار روان برای یادگیری نظریه زیان ها و ماشین ها با تمرینات مناسب. البته کتاب در مبحث گرامرها و همچنین پیچدگی جامع نیست و باید در کنار کتاب های دیگر مطالعه شود. ولی برای کسانی که برای اولین بار میخواهند نظریه زبان ها را یاد بگیرند همین کتاب را توصیه می کنم
بهترین و بهترین و بهترین کتاب یادگیری نظریه� زبان وماشینه. مثاله� و تمرینها� فوقالعاد� و مطالب رو کاملا عمقی توضیح مید�. به نظرم بهترین رفرنس ممکن برای شروع این فیلده.
درباره� نظریه زبانه� و ماشینهاست� و با خوندنش میفهمی� کامپایلر چطور متوجه خطای سینتکسی میشه. :دی متن خیلی روون و خوب، موضوع جذاب، ترتیب مناسب مباحث و همه چیز.
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.
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.
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.
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.
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.
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.
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.