کتاب نظریه زبان پیتر لینز – مقدمه ای بر زبان‌های صوری و ماشین‌های خودکار ویرایش پنجم
کتاب مقدمه ای بر زبان‌های صوری و ماشین‌های خودکار ویرایش پنجم
An Introduction to Formal Languages and Automata, 5th Edition 5th Edition
- ناشر : Jones & Bartlett Learning
- تاریخ انتشار : 2010
- نسخه : 5
- زبان : انگلیسی
- تعداد صفحات:427
- زبان:English
- نوع فایل: PDF
لینک‌هایی که باید ببینید:
- جهت مشاهده سایر کتاب‌ها کلیک کنید
- برای مشاوره رایگان کنکور (در تلگرام) پیام بدهید.
- .برای مشاهده ویدئو‌های آموزش و نکته و تست کنکور کامپیوتر کلیک کنید
خلاصه کتاب مقدمه ای بر زبان‌های صوری و ماشین‌های خودکار ویرایش پنجم:
Written to address the fundamentals of formal languages, automata, and computabilty, An Introduction to Formal Languages and Automata provides an accessible, student-friendly presentation of all material essential to an introductory Theory of Computation course.
It 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.
In the new Fifth Edition, Peter Linz continues to offer 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, the author has added new illustrative examples and exercises throughout. New and Key Features of the revised and updated Fifth Edition: Includes a new chapter within the appendices on finite-state transducers, including basic results on Mealy and Moore machines. This optional chapter can be used to prepare students for further related study. Provides an introduction to JFLAP, also within the appendices.
Many of the exercises in the text require creating structures that are complicated and that have to be tested for correctness. JFLAP can greatly reduce students time spent on testing as well as help them visualize abstract concepts.
A CD-ROM accompanies every new copy of the text and contains the following: A summary description of JFLAP; Numerous new exercises that illustrate the value and efficiency of JFLAP; JFLAP implementations of most of the examples in the text that allow students and instructors to experiment dynamically with these examples.
سرفصل‌ها:
INTRODUCTION TO THE THEORY OF COMPUTATION –
FINITE AUTOMATA –
REGULAR LANGUAGES AND REGULAR GRAMMARS –
PROPERTIES OF REGULAR LANGUAGES –
CONTEXT-FREE LANGUAGES –
SIMPLIFICATION OF CONTEXT-FREE GRAMMARS AND NORMAL FORMS –
PUSHDOWN AUTOMATA –
PROPERTIES OF CONTEXT-FREE LANGUAGES –
TURING MACHINES –
OTHER MODELS OF TURING MACHINES –
A HIERARCHY OF FORMAL LANGUAGES AND AUTOMATA –
LIMITS OF ALGORITHMIC COMPUTATION-
OTHER MODELS OF COMPUTATION –
AN OVERVIEW OF COMPUTATIONAL COMPLEXITY –
APPENDIX A: FINITE-STATE TRANSDUCERS –
APPENDIX B: JFLAP: A USEFUL TOOL –
ANSWERS SOLUTIONS AND HINTS FOR SELECTED EXERCISES –
دیدگاهتان را بنویسید