Черновик алгоритма Валианта.

Author: gsvgit

book_structure.md

@@ -111,6 +111,8 @@
 - ⚠️ Вводная часть главы: история вопроса, обзор, ссылки на Грюна и другие классические работы
 - ⚠️ Раздел "Алгоритм CYK" — `01_CYK.tex`
 - ⚠️ Раздел "Алгоритм Валианта" — `02_Valiant.tex`
+  - Интегрированы материалы из `papers_src/Yaveyn_alg/jbalg.tex` (разделы 1--2): терминология, определения подматриц, вспомогательные функции, основной алгоритм, пример. Модифицированный алгоритм (раздел 3) упомянут сноской со ссылкой на `papers_src/Modification_of_Valiants'_Algotithm/paper/`.
+  - Иллюстрации (4 PNG) перенесены из `papers_src/Yaveyn_alg/pics/` в `figures/02_Valiant/`, требуют перевода в TikZ.
 - ⚠️ Раздел "Построение множеств first и follow" — `03_FirstAndFollow.tex`
 - ⚠️ Раздел "Нисходящий синтаксический анализ" — `04_TopDown.tex`
   - ⚠️ Подраздел "Рекурсивный спуск"

tex/FormalLanguageConstrainedReachabilityLectureNotes.bib

@@ -2403,3 +2403,20 @@ @article{War62
   pages   = {11--12},
   year    = {1962}
 }
+
+@inproceedings{10.1007/978-3-030-63061-4_17,
+  author    = {Susanina, Yuliya and Yaveyn, Anna and Grigorev, Semyon},
+  title     = {Modification of Valiant’s Parsing Algorithm for the String-Searching Problem},
+  year      = {2019},
+  isbn      = {978-3-030-63060-7},
+  publisher = {Springer-Verlag},
+  address   = {Berlin, Heidelberg},
+  url       = {https://doi.org/10.1007/978-3-030-63061-4_17},
+  doi       = {10.1007/978-3-030-63061-4_17},
+  abstract  = {Some string-matching problems can be reduced to parsing: verification whether some sequence can be derived in the given grammar. To apply parser-based solutions to such area as bioinformatics, one needs to improve parsing techniques so that the processing of large amounts of data was possible. The most asymptotically efficient parsing algorithm that can be applied to any context-free grammar is a matrix-based algorithm proposed by Valiant. This paper presents a modification of the Valiant’s algorithm, which facilitates efficient utilization of modern hardware in highly-parallel implementation. Moreover, the modified version significantly decreases the number of excessive computations, accelerating the search of substrings.},
+  booktitle = {Computational Intelligence Methods for Bioinformatics and Biostatistics: 16th International Meeting, CIBB 2019, Bergamo, Italy, September 4–6, 2019, Revised Selected Papers},
+  pages     = {180–192},
+  numpages  = {13},
+  keywords  = {Secondary structure, String-matching, Valiant’s algorithm, Parsing, Context-free grammar},
+  location  = {Bergamo, Italy}
+}