کنکور کامپیوتر
0
ورود | ثبت نام
دانلود کتاب نظریه زبان پیتر لینز

دانلود کتاب نظریه زبان پیتر لینز

نویسنده : Peter Linz
427 صفحه
دانلود کتاب (free download)
English Title : An Introduction to Formal Languages and Automata, 5th Edition 5th Edition
عنوان فارسی : ویرایش پنجم کتاب مقدمه ای بر زبان‌های صوری و ماشین‌های خودکار

Description

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.

Table of contents

1 INTRODUCTION TO THE THEORY OF COMPUTATION
2 FINITE AUTOMATA
3 REGULAR LANGUAGES AND REGULAR GRAMMARS
4 PROPERTIES OF REGULAR LANGUAGES
5 CONTEXT-FREE LANGUAGES
6 SIMPLIFICATION OF CONTEXT-FREE GRAMMARS AND NORMAL FORMS
7 PUSHDOWN AUTOMATA
8 PROPERTIES OF CONTEXT-FREE LANGUAGES
9 TURING MACHINES
10 OTHER MODELS OF TURING MACHINES
11 A HIERARCHY OF FORMAL LANGUAGES AND AUTOMATA
12 LIMITS OF ALGORITHMIC COMPUTATION
13 OTHER MODELS OF COMPUTATION
14 AN OVERVIEW OF COMPUTATIONAL COMPLEXITY
APPENDIX A: FINITE-STATE TRANSDUCERS
APPENDIX B: JFLAP: A USEFUL TOOL
ANSWERS SOLUTIONS AND HINTS FOR SELECTED EXERCISES
امتیازدهی4.25 1 1 1 1 1 1 1 1 1 14.25 امتیاز (2 رای)

Peter Linz

Peter Linz, Professor Emeritus, University of California, DavisPeter Linz is Professor Emeritus in the Department of Computer Science at the University of California, Davis.Linz received his Ph.D. from the University of Wisconsin.Professor Linz's research emphasizes the development of a theory of numerical analysis that can be used in the construction of reliable numerical methods used in the design of problem-solving environments for scientific computing.Linz has released the seventh edition of An Introduction to Formal Languages and Automata, as well as Exploring Numerical Methods: An Introduction to Scientific Computing.