This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
lectures:books:atta [2023/12/03 21:17] – [About this book] krivka | lectures:books:atta [2024/01/18 17:38] (current) – krivka | ||
---|---|---|---|
Line 6: | Line 6: | ||
|Publication Date:|2023| | |Publication Date:|2023| | ||
|Details: | |Details: | ||
+ | |Official Book Website: | ||
===== Authors ===== | ===== Authors ===== | ||
Line 26: | Line 26: | ||
==== About this book ==== | ==== About this book ==== | ||
- | This computer science book gives{{ : | + | This computer science book gives{{ : |
First and foremost, this computer science book gives an account of the classical automata theory, including finite automata, pushdown automata, and Turing machines. Simultaneously, | First and foremost, this computer science book gives an account of the classical automata theory, including finite automata, pushdown automata, and Turing machines. Simultaneously, | ||
As far as the style of presentation is concerned, this book primarily represents a theoretically oriented treatment of automata and computability. All the formalisms concerning automata are introduced with enough rigor to make all results quite clear and valid. Every complicated mathematical passage is preceded by its intuitive explanation so that even the most complex parts of the book are easy to grasp. Secondarily, | As far as the style of presentation is concerned, this book primarily represents a theoretically oriented treatment of automata and computability. All the formalisms concerning automata are introduced with enough rigor to make all results quite clear and valid. Every complicated mathematical passage is preceded by its intuitive explanation so that even the most complex parts of the book are easy to grasp. Secondarily, | ||
- | {{: | + | |
===== Teaching materials ===== | ===== Teaching materials ===== | ||
* [[atta_lectures|Lectures (PDF)]] | * [[atta_lectures|Lectures (PDF)]] | ||
+ | |||
+ | ===== Errata ===== | ||
+ | |||
+ | * Ordered by appearance in the text. | ||
+ | * Last updated on 2023-12-11. | ||
+ | * Send additional errors and comments to: [[meduna@fit.vut.cz? | ||
+ | |||
+ | ==== List of Errors ==== | ||
+ | |||
+ | * Page 344, Section 11.5 Bottum-Up Parsing | ||
+ | * Mistake in a precedence table with unary operator ¬ (logical negation). The cell in row //i// and column //¬// should be empty. | ||
+ | * Reported 2023-12-11 by Zbyněk Křivka of Brno University of Technology. | ||
+ | |||
+ | * Page 344, Section 11.5 Bottum-Up Parsing, paragraph // | ||
+ | * The production rule //S → SS// should be //S → S - S// | ||
+ | * Reported 2023-12-18 by Zbyněk Křivka of Brno University of Technology. | ||
+ | |||
+ | ---- | ||
+ | |||
+ | The authors' | ||