| Both sides previous revisionPrevious revisionNext revision | Previous revision |
| lectures:books:rga [2014/01/26 15:11] – izemek | lectures:books:rga [2020/09/01 12:20] (current) – krivka |
|---|
| ====== Regulated Grammars and Automata ====== | ====== Regulated Grammars and Automata ====== |
| |
| |Authors:|**[[#authors|Alexander Meduna]]** and **[[#authors|Petr Zemek]]**|[[http://www.springer.com/computer/theoretical+computer+science/book/978-1-4939-0368-9|{{:lectures:books:rga_book_cover.jpg|Regulated Grammars and Automata}}]]| | |Authors:|**[[#authors|Alexander Meduna]]** and **[[#authors|Petr Zemek]]**| |
| |Title:|//Regulated Grammars and Automata//|:::| | |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|:::| | |ISBN:|978-1-4939-0368-9| |
| |Publication Date:|2014|:::| | |Publication Date:|2014-03-17| |
| |Details:|Hardcover, 668 pages|:::| | |Details:|Hardcover, 694 pages| |
| |
| ===== Authors ===== | ===== Authors ===== |
| |
| * [[http://www.fit.vutbr.cz/~meduna/work/doku.php?id=vita:vita|Vita]] | * [[http://www.fit.vutbr.cz/~meduna/work/doku.php?id=vita:vita|Vita]] |
| * [[http://www.fit.vutbr.cz/~meduna|Website]] | |
| * [[http://www.fit.vutbr.cz/~meduna/work|Scientific Work]] | * [[http://www.fit.vutbr.cz/~meduna/work|Scientific Work]] |
| | * [[http://www.fit.vutbr.cz/~meduna|University Website]] |
| |
| ---- | ---- |
| |
| {{ :lectures:books:rga_photo_pz.jpg?nolink| Petr Zemek}}**Petr Zemek** received his PhD from the Brno University of Technology in 2014 under the supervision of Alexander Meduna. He has published many studies on regulated grammars and automata in international conferences and distinguished computer science journals such as //Acta Informatica//, //Theoretical Computer Science// and //International Journal of Computer Mathematics//. | {{ :lectures:books:rga_photo_pz.jpg?nolink|Petr Zemek}}**Petr Zemek** received his PhD from the Brno University of Technology in 2014 under the supervision of Alexander Meduna. He has published many studies on regulated grammars and automata in international conferences and distinguished computer science journals such as //Acta Informatica//, //Theoretical Computer Science// and //International Journal of Computer Mathematics//. |
| |
| * [[http://www.fit.vutbr.cz/~izemek/curriculum.php.en|Vita]] | * [[http://www.fit.vutbr.cz/~izemek/curriculum.php.en|Vita]] |
| * [[http://www.fit.vutbr.cz/~izemek/index.php.en|Website]] | |
| * [[http://www.fit.vutbr.cz/~izemek/pubs.php.en|Scientific Work]] | * [[http://www.fit.vutbr.cz/~izemek/pubs.php.en|Scientific Work]] |
| | * [[http://www.fit.vutbr.cz/~izemek/index.php.en|University Website]] |
| | * [[http://petrzemek.net|Personal Website]] |
| |
| ===== Book ===== | ===== Book ===== |
| ==== 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, such as Internet with its numerous information processing tools, are based upon them to some extent, and indisputably, literary billions of people use these means on a daily basis. It thus comes as no surprise that the scientific development and study of languages and their processors fulfill a more important role today than ever before. Naturally, we expect that this study produces concepts and results that are as reliable as possible. As a result, we tend to base this study upon mathematics as a systematized body of unshakable knowledge obtained by exact and infallible reasoning. In this respect, we pay our principal attention to //formal language theory// as a branch of mathematics that formalizes languages and devices that define them strictly rigorously. | [[http://www.springer.com/computer/theoretical+computer+science/book/978-1-4939-0368-9|{{ :lectures:books:rga_book_cover.jpg|Regulated Grammars and Automata}}]]Language processors have become an inseparable part of our daily life. For instance, all the sophisticated modern means of communication, such as Internet with its numerous information processing tools, are based upon them to some extent, and indisputably, literary billions of people use these means on a daily basis. It thus comes as no surprise that the scientific development and study of languages and their processors fulfill a more important role today than ever before. Naturally, we expect that this study produces concepts and results that are as reliable as possible. As a result, we tend to base this study upon mathematics as a systematized body of unshakable knowledge obtained by exact and infallible reasoning. In this respect, we pay our principal attention to //formal language theory// as a branch of mathematics that formalizes languages and devices that define them strictly rigorously. |
| |
| 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, every programming language represents a formal language in terms of this definition. Consequently, formal language theory is important to all the scientific areas that make use of these languages to a certain extent. | 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, every programming language represents a formal language in terms of this definition. Consequently, formal language theory is important to all the scientific areas that make use of these languages to a certain extent. |
| |
| * 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?Subject=RGA: Error report|meduna@fit.vutbr.cz]] | * 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 ===== | ===== Springer Website ===== |
| |
| To buy the book, [[http://www.springer.com/computer/theoretical+computer+science/book/978-1-4939-0368-9|visit this website]]. | To buy the book, [[http://www.springer.com/computer/theoretical+computer+science/book/978-1-4939-0368-9|visit this website]]. If you are scholar, try your [[https://link.springer.com/book/10.1007%2F978-1-4939-0369-6|SpringerLink access]]. |
| |
| | ==== Statistics ==== |
| | ^Year^Downloaded Chapters^ |
| | |2014|3003| |
| | |2015|2150| |
| | |2016|2414| |
| | |2017|2259| |
| | |2018|1487| |
| | |2019|1737| |
| | |2020-Q1 and Q2|808| |
