Differences

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

--- lectures:books:mlmc [2017/07/11 10:26] – krivka
+++ lectures:books:mlmc [2020/09/07 13:18] (current) – krivka
@@ Line 16: / Line 16: @@
 ----
+{{ :lectures:books:mlmc_photo_os.jpg?nolink|Ondrej Soukup}}**Ondřej Soukup** received his PhD from the Brno University of Technology in 2017 under the supervision of Alexander Meduna.  He has published several studies on modern language models in such distinguished computer science journals as //Fundamenta Informatica//, ///International Journal of Foundations of Computer Science//, and //Theoretical Computer Science//.
-**Ondřej Soukup** received his PhD from the Brno University of Technology in 2017 under the supervision of Alexander Meduna.  He has published several studies on modern language models in such distinguished computer science journals as //Fundamenta Informatica//, ///International Journal of Foundations of Computer Science//, and //Theoretical Computer Science//.
   * [[http://www.fit.vutbr.cz/~isoukup/curriculum.php.en|Vita]]
   * [[http://www.fit.vutbr.cz/~isoukup/pubs.php.en|Scientific Work]]
   * [[http://www.fit.vutbr.cz/~isoukup/index.php.en|University Website]]
+===== Book =====
+==== About this book ====
+{{ :lectures:books:mlmc_book_cover.jpg?nolink&100|}}This textbook gives a systematized and compact summary, providing the most essential types of modern models for languages and computation together with their properties and applications. Most of these models properly reflect and formalize current computational methods, based on parallelism, distribution and cooperation covered in this book. As a result, it allows the user to develop, study, and improve these methods very effectively.
+This textbook also represents the first systematic treatment of modern language models for computation. It covers all essential theoretical topics concerning them. From a practical viewpoint, it describes various concepts, methods, algorithms, techniques, and software units based upon these models. Based upon them, it describes several applications in biology, linguistics, and computer science.
+Advanced-level students studying computer science, mathematics, linguistics and biology will find this textbook a valuable resource. Theoreticians, practitioners and researchers working in today’s theory of computation and its applications will also find this book essential as a reference.
 ===== Errata =====
+  * Ordered by appearance in the text.
+  * Last updated on 2018-01-31.
   * Please, send additional errors and comments to: [[meduna@fit.vutbr.cz?Subject=MLMC: Error report|meduna@fit.vutbr.cz]]
-  * TBA: Ordered by appearance in the text.
+==== List of Errors ====
+  * Page 173, Chapter 4, Section 4.1.4 (Reduction)
+  * In Definition 4.1.12, instead of "//lhs(p) ≥ 2//", there should be "//len(p) ≥ 2//" in the definition of dcs(//G//).
+  * Reported 2018-01-31 by Zbyněk Křivka of Brno University of Technology.
+  * Page 321, Chapter 7, Section 7.1.1 (Self-Regulating Finite Automata)
+  * In Definition 7.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 322, Chapter 7, Section 7.1.1 (Self-Regulating Finite Automata)
+  * In Example 7.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 //R//.
+  * Reported 2018-11-06 by Roman Andriushchenko of Brno University of Technology.
+----
+The authors' thanks go to the readers who pointed out the errors.
 ===== Springer Website =====
-To buy the book, [[http://www.springer.com/gp/book/9783319630991|visit this website]].
+To buy the book, [[http://www.springer.com/gp/book/9783319630991|visit this website]] or [[https://www.amazon.com/Modern-Language-Models-Computation-Applications/dp/3319630997/ref=sr_1_1?s=books&ie=UTF8&qid=1497634524&sr=1-1&keywords=meduna+soukup|Amazon website]]
+==== Statistics ====
+^Year^Downloaded Chapters^
+|2017|1422|
+|2018|3337|
+|2019|1441|
+|2020-Q1 and Q2|756|