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 [2018/11/06 09:11] – [List of Errors] krivka | lectures:books:mlmc [2018/11/07 15:25] – [List of Errors] krivka | ||
|---|---|---|---|
| Line 44: | Line 44: | ||
| * In Definition 4.1.12, instead of "// | * In Definition 4.1.12, instead of "// | ||
| * Reported 2018-01-31 by Zbyněk Křivka of Brno University of Technology. | * 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) | * Page 321, Chapter 7, Section 7.1.1 (Self-Regulating Finite Automata) | ||
| Line 51: | Line 49: | ||
| * Reported 2018-11-06 by Roman Andriushchenko of Brno University of Technology. | * 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. | ||
| ---- | ---- | ||