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:rga [2018/11/06 09:13] – krivka | lectures:books:rga [2018/11/07 15:26] – krivka | ||
|---|---|---|---|
| Line 96: | Line 96: | ||
| * Page 511, Chapter 15 (Self-Regulating Automata), Section 15.1.1 (Definitions and Examples) | * Page 511, Chapter 15 (Self-Regulating Automata), Section 15.1.1 (Definitions and Examples) | ||
| * In Definition 15.1.2, instead of "j = 0, 1, ..., n", there should be "j = 0, 1, ..., n-1". | * In Definition 15.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 511, Chapter 15 (Self-Regulating Automata), Section 15.1.1 (Definitions and Examples) | ||
| + | * In Example 15.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 the last component of //M//. | ||
| * Reported 2018-11-06 by Roman Andriushchenko of Brno University of Technology. | * Reported 2018-11-06 by Roman Andriushchenko of Brno University of Technology. | ||