This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
lectures:books:mlmc [2017/07/11 10:35] – [Springer Website] krivka | lectures:books:mlmc [2020/09/07 13:18] (current) – krivka | ||
---|---|---|---|
Line 25: | Line 25: | ||
==== About this book ==== | ==== About this book ==== | ||
- | This textbook gives a systematized and compact summary, providing the most essential types of modern models for languages and computation together with their properties and applications. Most of these models properly reflect and formalize current computational methods, based on parallelism, | + | {{ : |
This textbook also represents the first systematic treatment of modern language models for computation. It covers all essential theoretical topics concerning them. From a practical viewpoint, it describes various concepts, methods, algorithms, techniques, and software units based upon these models. Based upon them, it describes several applications in biology, linguistics, | This textbook also represents the first systematic treatment of modern language models for computation. It covers all essential theoretical topics concerning them. From a practical viewpoint, it describes various concepts, methods, algorithms, techniques, and software units based upon these models. Based upon them, it describes several applications in biology, linguistics, | ||
Line 35: | Line 35: | ||
===== Errata ===== | ===== Errata ===== | ||
+ | * Ordered by appearance in the text. | ||
+ | * Last updated on 2018-01-31. | ||
* Please, send additional errors and comments to: [[meduna@fit.vutbr.cz? | * Please, send additional errors and comments to: [[meduna@fit.vutbr.cz? | ||
- | * TBA: Ordered by appearance in the text. | ||
+ | ==== List of Errors ==== | ||
+ | |||
+ | * Page 173, Chapter 4, Section 4.1.4 (Reduction) | ||
+ | * In Definition 4.1.12, instead of "// | ||
+ | * Reported 2018-01-31 by Zbyněk Křivka of Brno University of Technology. | ||
+ | |||
+ | * Page 321, Chapter 7, Section 7.1.1 (Self-Regulating Finite Automata) | ||
+ | * In Definition 7.1.2, instead of "j = 0, 1, ..., n", there should be "j = 0, 1, ..., n-1". | ||
+ | * Reported 2018-11-06 by Roman Andriushchenko of Brno University of Technology. | ||
+ | |||
+ | * Page 322, Chapter 7, Section 7.1.1 (Self-Regulating Finite Automata) | ||
+ | * In Example 7.1.3, 1-first-SFA //M// does not accept //ab//, so //L(M)// should be //{a^n b^n | n > 1}//. Note that we get original //L(M)// by adding //(2,3)// into //R//. | ||
+ | * Reported 2018-11-06 by Roman Andriushchenko of Brno University of Technology. | ||
+ | ---- | ||
+ | |||
+ | The authors' | ||
===== Springer Website ===== | ===== Springer Website ===== | ||
To buy the book, [[http:// | To buy the book, [[http:// | ||
+ | |||
+ | ==== Statistics ==== | ||
+ | ^Year^Downloaded Chapters^ | ||
+ | |2017|1422| | ||
+ | |2018|3337| | ||
+ | |2019|1441| | ||
+ | |2020-Q1 and Q2|756| |