This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
lectures:books:rga [2018/11/07 15:24] – krivka | lectures:books:rga [2020/09/01 12:20] (current) – krivka | ||
---|---|---|---|
Line 99: | Line 99: | ||
* 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 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 the adding //(2,3)// into the last component of //M//. | + | * 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. | ||
Line 120: | Line 120: | ||
===== Springer Website ===== | ===== Springer Website ===== | ||
- | To buy the book, [[http:// | + | To buy the book, [[http:// |
+ | ==== Statistics ==== | ||
+ | ^Year^Downloaded Chapters^ | ||
+ | |2014|3003| | ||
+ | |2015|2150| | ||
+ | |2016|2414| | ||
+ | |2017|2259| | ||
+ | |2018|1487| | ||
+ | |2019|1737| | ||
+ | |2020-Q1 and Q2|808| |