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 [2014/01/26 15:11] – izemek | lectures:books:rga [2018/11/07 15:26] – krivka | ||
---|---|---|---|
Line 1: | Line 1: | ||
====== Regulated Grammars and Automata ====== | ====== Regulated Grammars and Automata ====== | ||
- | |Authors: | + | |Authors: |
- | |Title: | + | |Title: |
- | |Publisher: | + | |Publisher: |
- | |ISBN: | + | |ISBN: |
- | |Publication Date:|2014|:::| | + | |Publication Date:|2014-03-17| |
- | |Details: | + | |Details: |
===== Authors ===== | ===== Authors ===== | ||
Line 13: | Line 13: | ||
* [[http:// | * [[http:// | ||
- | * [[http:// | ||
* [[http:// | * [[http:// | ||
+ | * [[http:// | ||
---- | ---- | ||
- | {{ : | + | {{ : |
* [[http:// | * [[http:// | ||
- | * [[http:// | ||
* [[http:// | * [[http:// | ||
+ | * [[http:// | ||
+ | * [[http:// | ||
===== Book ===== | ===== Book ===== | ||
Line 28: | Line 29: | ||
==== Motivation and Subject ==== | ==== Motivation and Subject ==== | ||
- | Language processors have become an inseparable part of our daily life. For instance, all the sophisticated modern means of communication, | + | [[http:// |
This theory defines languages mathematically as sets of sequences consisting of symbols. This definition encompasses almost all languages as they are commonly understood. Indeed, natural languages, such as English, are included in this definition. Of course, all artificial languages introduced by various scientific disciplines can be viewed as formal languages as well; perhaps most illustratively, | This theory defines languages mathematically as sets of sequences consisting of symbols. This definition encompasses almost all languages as they are commonly understood. Indeed, natural languages, such as English, are included in this definition. Of course, all artificial languages introduced by various scientific disciplines can be viewed as formal languages as well; perhaps most illustratively, | ||
Line 84: | Line 85: | ||
* Ordered by appearance in the text. | * 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? | * Send additional errors and comments to: [[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 // | ||
+ | * Reported 2015-03-16 by Vojtěch Vorel of the Charles University. | ||
+ | |||
+ | ---- | ||
+ | |||
+ | The authors' | ||
===== Springer Website ===== | ===== Springer Website ===== |