Заготовки для введения в теорию формальных языков.

Author: gsvgit

tex/FormalLanguageConstrainedReachabilityLectureNotes.bib

@@ -1763,4 +1763,45 @@ @inproceedings{Terekhov2021MultipleSourceCP
   booktitle={International Conference on Extending Database Technology},
   year={2021},
   url={https://api.semanticscholar.org/CorpusID:232284054}
+}
+
+@article{10.1145/321239.321249,
+author = {Brzozowski, Janusz A.},
+title = {Derivatives of Regular Expressions},
+year = {1964},
+issue_date = {Oct. 1964},
+publisher = {Association for Computing Machinery},
+address = {New York, NY, USA},
+volume = {11},
+number = {4},
+issn = {0004-5411},
+url = {https://doi.org/10.1145/321239.321249},
+doi = {10.1145/321239.321249},
+journal = {J. ACM},
+month = {oct},
+pages = {481–494},
+numpages = {14}
+}
+
+@book{Leiss1999,
+  doi = {10.1007/978-1-4612-2156-2},
+  url = {https://doi.org/10.1007/978-1-4612-2156-2},
+  year = {1999},
+  publisher = {Springer New York},
+  author = {Ernst L. Leiss},
+  title = {Language Equations}
+}
+
+@article{MRYKHIN2023113829,
+title = {The hardest language for grammars with context operators},
+journal = {Theoretical Computer Science},
+volume = {958},
+pages = {113829},
+year = {2023},
+issn = {0304-3975},
+doi = {https://doi.org/10.1016/j.tcs.2023.113829},
+url = {https://www.sciencedirect.com/science/article/pii/S0304397523001421},
+author = {Mikhail Mrykhin and Alexander Okhotin},
+keywords = {Formal language theory, Formal grammars, Hardest formal languages, Grammars with context operators, Inverse homomorphisms, Finite transducers},
+abstract = {In 1973, Greibach (“The hardest context-free language”, SIAM J. Comp., 1973) constructed a context-free language L0 with the property that every context-free language can be reduced to L0 by a homomorphism, thus representing it as an inverse homomorphic image h−1(L0). In this paper, a similar characterization is established for a family of grammars equipped with operators for referring to the left context of any substring, recently defined by Barash and Okhotin (“An extension of context-free grammars with one-sided context specifications”, Inform. Comput., 2014). An essential step of the argument is a new normal form for grammars with context operators, in which every nonterminal symbol defines only strings of odd length in left contexts of even length: the even-odd normal form. The characterization is completed by showing that the language family defined by grammars with context operators is closed under inverse homomorphisms; actually, it is closed under injective nondeterministic finite transductions.}
 }