Differences

This shows you the differences between two versions of the page.

--- lectures:books:rga [2014/03/15 17:49] – izemek
+++ lectures:books:rga [2018/11/07 15:26] – krivka
@@ Line 3: / Line 3: @@
 |Authors:|**[[#authors|Alexander Meduna]]** and **[[#authors|Petr Zemek]]**|
 |Title:|//Regulated Grammars and Automata//|
-|Publisher:|[[http://www.springer.com/computer/theoretical+computer+science/book/978-1-4939-0368-9|Springer]], TBD|
+|Publisher:|[[http://www.springer.com/computer/theoretical+computer+science/book/978-1-4939-0368-9|Springer]], New York, US|
 |ISBN:|978-1-4939-0368-9|
-|Publication Date:|2014|
+|Publication Date:|2014-03-17|
-|Details:|Hardcover, 668 pages|
+|Details:|Hardcover, 694 pages|
 ===== Authors =====
@@ Line 85: / Line 85: @@
   * Ordered by appearance in the text.
-  * Last updated on TBA.
+  * Last updated on 2017-05-03.
   * Send additional errors and comments to: [[meduna@fit.vutbr.cz?Subject=RGA: Error report|meduna@fit.vutbr.cz]]
-==== The List of Errors ====
+==== List of Errors ====
-  * -
+  * Page 21, Chapter 3 (Rudiments of Formal Language Theory), Section 3.3 (Grammars)
+  * In Definition 3.3.1, instead of //x = x_1ux_2, y = y_1vy_2//, there should be //x = x_1ux_2, y = x_1vx_2//. The subsequent occurrences of //y_1// and //y_2// should be removed from the definition.
+  * Reported 2017-05-02 by Radek Vít of Brno University of Technology.
+  * 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".
+  * 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.
+  * Page 576, Chapter 17 (Jumping Finite Automata), Section 17.4 (Closure Properties)
+  * Theorem 17.4.15 does not hold. For example, language //L = {a}*// belongs to **GJFA**, but //K = {bc}*// does not belong to **GJFA**. Language //K// is obtained from //L// by a finite substitution that maps //a// to //bc//.
+  * Reported 2015-03-16 by Vojtěch Vorel of the Charles University.
+  * Page 576, Chapter 17 (Jumping Finite Automata), Section 17.4 (Closure Properties)
+  * Corollary 17.4.16 does not hold. This fact follows from the above example (notice that the finite substitution in there is, in fact, a homomorphism).
+  * Reported 2015-03-16 by Vojtěch Vorel of the Charles University.
+  * Page 577, Chapter 17 (Jumping Finite Automata), Section 17.4 (Closure Properties)
+  * Theorem 17.4.19 does not hold for **GJFA**. A GJFA //M// and a homomorphism //h// can be constructed so that //h^-1(L(M))// does not belong to **GJFA**.
+  * Reported 2015-03-16 by Vojtěch Vorel of the Charles University.
+----
+The authors' thanks go to the readers who pointed out the errors.
 ===== Springer Website =====