مقدمه‌ای بر نظریه اتوماتا، زبان‌ها و محاسبات، ویرایش دوم

This entire subject is very difficult. I suppose that i wouldn't know that this book was bad if i hadn't read better?Computability: An Introduction to Recursive Function Theory for instance, uses much more understandable language and symbols. In most cases books in this area of language and automata theory are difficult, but most authors realize this and try to make the text more understandable. I suppose if this were a text for a class I'd be faced with trying to find a Schaum's outline text to get me through the course? In other words the text is a failure that seems to be difficult for even people who are familiar with the material. My heart goes out to students who have only this text for their class: an instructor that choses such a text will be no help in his lectures? "This classic book on formal languages, automata theory, and computational complexity has been updated to present theoretical concepts in a concise and straightforward manner with increased coverage of practical applications. This third edition offers students a less formal writing style while providing the most accessible coverage of automata theory available, solid treatment on constructing proofs, many figures and diagrams to help convey ideas, and sidebars to highlight related material. A new feature of this edition is Gradiance, a Web-based homework and assessment tool. Each chapter offers an abundance of exercises, including selected Gradiance problems, for a true hands-on learning experience for students."--BOOK JACKET. It has been more than 20 years since this classic book on formal languages, automata theory, and computational complexity was first published. With this long-awaited revision, the authors continue to present the theory in a concise and straightforward manner, now with an eye out for the practical applications. They have revised this book to make it more accessible to today's students, including the addition of more material on writing proofs, more figures and pictures to convey ideas, side-boxes to highlight other interesting material, and a less formal writing style. Exercises at the end of each chapter, including some new, easier exercises, help readers confirm and enhance their understanding of the material. This title seeks to present automata theory in a simple and straightforward manner. It includes material on writing proofs, figures and pictures to convey ideas, side boxes to present supplemental material, and program-like notation for PDAs and Turing machines.