I. Agol, The virtual Haken conjecture, Doc. Math. 18 (2013), 1045–1087, With an appendix by Agol, Daniel Groves, and Jason Manning. Google Scholar
A. V. Anīsīmov, The group languages, Kibernet. (Kiev) 4 (1971), 18–24. Google Scholar
M. Aschenbrenner, S. Friedl and H. Wilton, 3-manifold Groups, EMS Ser. Lect. Math., European Mathematical Society (EMS), Zürich, 2015. Google Scholar
G. Baumslag, Lecture Notes on Nilpotent Groups, CBMS Reg. Conf. Ser. Math. 2, American Mathematical Society, Providence, 1971. Google Scholar
A. Brandstädt, V. B. Le and J. P. Spinrad, Graph Classes: A Survey, SIAM Monogr. Discrete Math. Appl., Society for Industrial and Applied Mathematics (SIAM), Philadelphia, 1999. Google Scholar
T. Brough, Groups with poly-context-free word problem, Groups Complex. Cryptol. 6 (2014), no. 1, 9–29. Google Scholar
R. H. Gilman, Formal languages and infinite groups, Geometric and Computational Perspectives on Infinite Groups (Minneapolis/New Brunswick 1994), DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 25, American Mathematical Society, Providence (1996), 27–51. Google Scholar
S. Ginsburg, Algebraic and Automata-theoretic Properties of Formal Languages, North-Holland, Amsterdam, 1975. Google Scholar
M. Hall, Jr., The Theory of Groups, The Macmillan, New York, 1959. Google Scholar
M. A. Harrison, Introduction to Formal Language Theory, Addison-Wesley, Reading, 1978. Google Scholar
M.-C. Ho, The word problem of is a multiple context-free language, Groups Complex. Cryptol. 10 (2018), no. 1, 9–15. Google Scholar
J. E. Hopcroft and J. D. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, 1979. Google Scholar
L. Kallmeyer, Parsing Beyond Context-free Grammars, Springer Ser, Cognitive Technol., Springer, Berlin, 2010. Google Scholar
R. P. Kropholler and D. Spiriano, The class of groups with MCF word problem is closed under free products, preprint (2017).
A. Mateescu and A. Salomaa, Formal languages: An introduction and a synopsis, Handbook of Formal Languages. Vol. 1, Springer, Berlin (1997), 1–39. Google Scholar
S. Salvati, MIX is a 2-MCFL and the word problem in is captured by the IO and the OI hierarchies, J. Comput. System Sci. 81 (2015), no. 7, 1252–1277. Google Scholar
K. Vijay-Shanker, D. J. Weir and A. K. Joshi, Characterizing structural descriptions produced by various grammatical formalisms, Proceedings of the 25th Annual Meeting on Association for Computational Linguistics—ACL ’87, Association for Computational Linguistics, Stroudsburg (1987), 104–111. Google Scholar
D. T. Wise, The structure of groups with a quasiconvex hierarchy, Lectures (2011).
About the article
Published Online: 2018-10-30
Published in Print: 2018-11-01
Funding Source: National Science Foundation
Award identifier / Grant number: DMS-1440140
This material is based upon work supported by the National Science Foundation grant DMS-1440140 while the authors were in residence at the Mathematical Science Research Institute (MSRI) in Berkeley, California, during the Fall 2016 Semester.