This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revisionLast revisionBoth sides next revision | ||
lectures:books:mlmc [2017/07/11 10:36] – [About this book] krivka | lectures:books:mlmc [2018/11/07 15:25] – [List of Errors] krivka | ||
---|---|---|---|
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:// |