Merge branch 'dev' into main

Author: gsvgit

tex/FormalLanguageConstrainedReachabilityLectureNotes.bib

@@ -1,4 +1,4 @@
-8@book{Hopcroft+Ullman/79/Introduction,
+@book{Hopcroft+Ullman/79/Introduction,
     added-at = {2009-05-20T01:29:36.000+0200},
     author = {Hopcroft, John E. and Ullman, Jeff D.},
     biburl = {https://www.bibsonomy.org/bibtex/26f42b10773b0f97be73d4e0d6b8db3bf/sriram0339},
@@ -1352,10 +1352,78 @@ @article{BEATTY1980193
 abstract = "The structure of derivation trees over an LL(k) grammar is explored and a property of these trees obtained which is shown to characterize the LL(k) grammars. This characterization, called the LL(k) Left Part Theorem, makes it possible to establish a pair of iteration theorems for the LL(k) languages. These theorems provide a general and powerful method of showing that a language is not LL(k) when that is the case. They thus provide for the first time a flexible tool with which to explore the structure of the LL(k) languages and with which to discriminate between the LL(k) and LR(k) language classes. Examples are given of LR(k) languages which, for various reasons, fail to be LL(k). Easy and rigorous proofs to this effect are given using our LL(k) iteration theorems. In particular, it is proven that the dangling-ELSE construct allowed in PL/I and Pascal cannot be generated by any LL(k) grammar. We also give a new and straightforward proof based on the LL(k) Left Part Theorem that every LL(k) grammar is LR(k)."
 }
 
-@MISC{VavilovGroups,
-  author = "Николай Александрович Вавилов",
-  title = "КОНКРЕТНАЯ ТЕОРИЯ ГРУПП",
-  year = "2005",
-  url = "http://dobrochan.com/src/pdf/1512/%D0%92%D0%B0%D0%B2%D0%B8%D0%BB%D0%BE%D0%B2-%D0%9D.-%D0%9A%D0%BE%D0%BD%D0%BA%D1%80%D0%B5%D1%82%D0%BD%D0%B0%D1%8F-%D1%82%D0%B5%D0%BE%D1%80%D0%B8%D1%8F-%D0%B3%D1%80%D1%83%D0%BF%D0%BF.-%D0%9E%D1%81%D0%BD%D0%BE%D0%B2%D0%BD%D1%8B%D0%B5-%D0%BF%D0%BE%D0%BD%D1%8F%D1%82.pdf",
-  note = "Дата доступа: 29 июня 2021 г."
+@misc{VavilovGroups,
+  language={russian},
+  author = {{\CYRN}иколай Вавилов},
+  title = {КОНКРЕТНАЯ ТЕОРИЯ ГРУПП},
+  year = {2005},
+  url = {http://dobrochan.com/src/pdf/1512/Вавилов-Н.-Конкретная-теория-групп.-Основные-понят.pdf},
+  note = {Дата доступа: 29 июня 2021 г.}
 }
+
+
+@misc{VavilovRings,
+  language={russian},
+  author = {{\CYRN}иколай Вавилов},
+  title = {КОНКРЕТНАЯ ТЕОРИЯ КОЛЕЦ},
+  year = {2006},
+  url = {http://www.add3d.ru/wp-content/uploads/2019/10/Vavilov-Rings.pdf},
+  note = {Дата доступа: 29 июня 2021 г.}
+}
+
+@misc{das2018lower,
+      title={Lower bounds for Combinatorial Algorithms for Boolean Matrix Multiplication}, 
+      author={Debarati Das and Michal Koucký and Michael Saks},
+      year={2018},
+      eprint={1801.05202},
+      archivePrefix={arXiv},
+      primaryClass={cs.CC}
+}
+
+@misc{alman2020refined,
+      title={A Refined Laser Method and Faster Matrix Multiplication}, 
+      author={Josh Alman and Virginia Vassilevska Williams},
+      year={2020},
+      eprint={2010.05846},
+      archivePrefix={arXiv},
+      primaryClass={cs.DS}
+}
+
+@INPROCEEDINGS{5438580,
+  author={Bansal, Nikhil and Williams, Ryan},
+  booktitle={2009 50th Annual IEEE Symposium on Foundations of Computer Science}, 
+  title={Regularity Lemmas and Combinatorial Algorithms}, 
+  year={2009},
+  volume={},
+  number={},
+  pages={745-754},
+  doi={10.1109/FOCS.2009.76}}
+
+@InProceedings{10.1007/978-3-662-47672-7_89,
+author="Yu, Huacheng",
+editor="Halld{\'o}rsson, Magn{\'u}s M.
+and Iwama, Kazuo
+and Kobayashi, Naoki
+and Speckmann, Bettina",
+title="An Improved Combinatorial Algorithm for Boolean Matrix Multiplication",
+booktitle="Automata, Languages, and Programming",
+year="2015",
+publisher="Springer Berlin Heidelberg",
+address="Berlin, Heidelberg",
+pages="1094--1105",
+abstract="We present a new combinatorial algorithm for triangle finding and Boolean matrix multiplication that runs in {\$}{\$}{\backslash}hat{\{}O{\}}(n^3/{\backslash}log ^4 n){\$}{\$}O^(n3/log4n)time, where the {\$}{\$}{\backslash}hat{\{}O{\}}{\$}{\$}O^notation suppresses poly(loglog) factors. This improves the previous best combinatorial algorithm by Chan [4] that runs in {\$}{\$}{\backslash}hat{\{}O{\}}(n^3/{\backslash}log ^3 n){\$}{\$}O^(n3/log3n)time. Our algorithm generalizes the divide-and-conquer strategy of Chan's algorithm.",
+isbn="978-3-662-47672-7"
+}
+
+
+@article{ArlDinKro70,
+author = {{\CYRV}. Арлазаров and {\CYRE}. Диниц and {\CYRM}. Кронрод and {\CYRI}. Фараджев},
+title = {Об экономном построении транзитивного замыкания ориентированного графа},
+journal = {Докл. АН СССР},
+year = {1970},
+volume = {194},
+number = {3},
+pages = {487--488},
+url = {http://mi.mathnet.ru/dan35675}
+}
+

tex/FormalLanguageConstrainedReachabilityLectureNotes.tex

@@ -158,7 +158,7 @@
 
 \input{List_of_contributors}
 \input{Introduction}
-%\input{LinearAlgebra}
+\input{LinearAlgebra}
 \input{GraphTheoryIntro}
 \input{FormalLanguageTheoryIntro}
 \input{FLPQ}