| Both sides previous revisionPrevious revisionNext revision | Previous revision |
| lectures:books:atta [2023/10/01 22:12] – ikozar | lectures:books:atta [2024/01/18 17:38] (current) – krivka |
|---|
| |Publication Date:|2023| | |Publication Date:|2023| |
| |Details:|Hardcover, 418 pages| | |Details:|Hardcover, 418 pages| |
| | |Official Book Website:|[[https://www.worldscientific.com/worldscibooks/10.1142/13464#t=aboutBook]]| |
| ===== Authors ===== | ===== Authors ===== |
| |
| * [[https://www.fit.vutbr.cz/~meduna/work|Scientific Work]] | * [[https://www.fit.vutbr.cz/~meduna/work|Scientific Work]] |
| * [[https://www.fit.vutbr.cz/~meduna|University Website]] | * [[https://www.fit.vutbr.cz/~meduna|University Website]] |
| | \\ |
| |
| ---- | ---- |
| | {{ :lectures:books:kozar-fotka.jpg?nolink100x132|Tomáš Kožár}}**Tomáš Kožár** is a distinguished PhD Student supervised by Alexander Meduna at the Faculty of Information Technology, [[http://www.fit.vutbr.cz/.en|Brno University of Technology]], Czech Republic. |
| **Tomáš Kožár** is a distinguished PhD Student supervised by Alexander Meduna at the Faculty of Information Technology, [[http://www.fit.vutbr.cz/.en|Brno University of Technology]], Czech Republic. | |
| |
| * [[https://www.fit.vutbr.cz/~ikozar|University Website]] | * [[https://www.fit.vutbr.cz/~ikozar|University Website]] |
| | \\ |
| | \\ |
| | \\ |
| ===== Book ===== | ===== Book ===== |
| |
| ==== About this book ==== | ==== About this book ==== |
| This computer science book gives an in-depth account of the theory of automata and computation. It also covers modern trends in automata theory. Furthermore, the text maintains a balance between a theoretical and practical approach to its subject by presenting many applications of automata. It is meant as a monograph as well as the basis of a one-term course on this subject at the graduate level. | This computer science book gives{{ :lectures:books:attta_book_cover.jpg?nolink&150|}} an in-depth account of the theory of automata and computation. It also covers modern trends in automata theory. Furthermore, the text maintains a balance between a theoretical and practical approach to its subject by presenting many applications of automata. It is meant as a monograph as well as the basis of a one-term course on this subject at the graduate level. |
| |
| First and foremost, this computer science book gives an account of the classical automata theory, including finite automata, pushdown automata, and Turing machines. Simultaneously, it pays a special attention to the consequences following from this theory in terms of computability, decidability, and complexity. In this way, it explains the fundamentals of the theory of computation. Second, it overviews currently active trends in automata theory, such as jumping, deep pushdown, and regulated automata. Finally, the book also describes real practical use of automata in a variety of scientific areas, ranging from programming language processing through natural language syntax analysis up to computational musicology. | First and foremost, this computer science book gives an account of the classical automata theory, including finite automata, pushdown automata, and Turing machines. Simultaneously, it pays a special attention to the consequences following from this theory in terms of computability, decidability, and complexity. In this way, it explains the fundamentals of the theory of computation. Second, it overviews currently active trends in automata theory, such as jumping, deep pushdown, and regulated automata. Finally, the book also describes real practical use of automata in a variety of scientific areas, ranging from programming language processing through natural language syntax analysis up to computational musicology. |
| ===== 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?Subject=ATTA: Error report|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 //Arithmetic Expressions with Right-Associative Operators// |
| | * 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' thanks go to the readers who pointed out the errors. |
| |
