کتاب مقدمه ای بر زبان های صوری و ماشین های خودکار – ویرایش ششم
کتاب مقدمه ای بر زبان های صوری و ماشین های خودکار – ویرایش ششم
An Introduction to Formal Languages and Automata 6th Edition
- انتشارات:Jones & Bartlett Learning
- توسط:Peter Linz
- ISBN:9781284077247
- تاریخ انتشار:2016
- تعداد صفحات:450
- زبان:English
- نوع فایل: PDF
لینک‌هایی که باید ببینید:
- جهت مشاهده سایر کتاب‌ها کلیک کنید
- برای مشاوره رایگان کنکور (در تلگرام) پیام بدهید.
- .برای مشاهده ویدئو‌های آموزش و نکته و تست کنکور کامپیوتر کلیک کنید
خلاصه کتاب مقدمه ای بر زبان های صوری و ماشین های خودکار – ویرایش ششم:
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 Features:
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
سرفصل‌ها:
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 –
دیدگاهتان را بنویسید