Course Bibliography
- D. Yu. Burago, Periodic metrics, in Representation theory and dynamical systems, 205—210, Adv. Soviet Math., 9, Amer. Math. Soc., Providence, RI. MR1166203 | MathSciNet Review |
- T. Denkinger, An automata characterisation for multiple context-free languages, in Developments in language theory, 138—150, Lecture Notes in Comput. Sci., 9840, Springer, Berlin. MR3558097 | Article | MathSciNet Review | arXiv |
- D. B. A. Epstein et al., Word processing in groups, Jones and Bartlett Publishers, Boston, MA, 1992. MR1161694 | MathSciNet Review |
- R. H. Gilman, Formal languages and their application to combinatorial group theory, in Groups, languages, algorithms, 1—36, Contemp. Math., 378, Amer. Math. Soc., Providence, RI. MR2159313 | Chapter | MathSciNet Review |
- M.-C. Ho, The word problem of Zn is a multiple context-free language, preprint | arXiv |
- M. Kanazawa et al., The failure of the strong pumping lemma for multiple context-free languages, Theory Comput. Syst. 55 (2014), no. 1, 250—278. MR3212892 | Article | MathSciNet Review |
- R. Kropholler, D. Spriano, Closure properties in the class of multiple context free groups, preprint | arXiv |
- D. E. Muller, P. E. Schupp, Groups, the theory of ends, and context-free languages, J. Comput. System Sci. 26 (1983), no. 3, 295—310. MR0710250 | Article | MathSciNet Review |
- M.-J. Nederhof, A short proof that O2 is an MCFL, in Proceedings of the 54th Annual Meeting of the Annual Meeting of the Association for Computational Linguistics, 1117—1126, Berlin, August 2016. | Article | arXiv |
- M.-J. Nederhof, Free word order and MCFLs. In M. Wieling, M. Kroon, G. van Noord, and G. Bouma, editors, From Semantics to Dialectometry: Festschrift for John Nerbonne, Chapter 28, 273—282, College Publications, 2017. | Article |
- S. Salvati, MIX is a 2-MCFL and the word problem in Z2 is captured by the IO and the OI hierarchies, J. Comput. System Sci. 81 (2015), no. 7, 1252—1277. MR3354791 | Article | MathSciNet Review |
- H. Seki et al., On multiple context-free grammars, Theoret. Comput. Sci. 88 (1991), no. 2, 191—229. MR1131066 | Article | MathSciNet Review |