Closure properties in the class of multiple context-free groups
-
Robert P. Kropholler
und
Davide Spriano
Abstract
We show that the class of groups with k-multiple context-free word problem is closed under graphs of groups with finite edge groups.
Funding source: National Science Foundation
Award Identifier / Grant number: DMS-1440140
Funding statement: This work was started at MSRI, Berkeley, where research is supported by the National Science Foundation under Grant No. DMS-1440140.
Acknowledgements
We greatly thank Bob Gilman for introducing us to the subject and making this project possible. The second author would like to thank UC Berkeley for inviting him as a visiting scholar. The first author would like to thank Alessandro Sisto for inviting him to complete this work at the ETH. We thank the anonymous referee for helpful comments and suggestions, in particular, the addition of Section 6. Finally, we would like to thank Neil Fullarton for his invaluable work with a stapler.
References
[1] N. Chomsky, Context-free grammars and pushdown storage, Quart. Progress Rep. 65 (1962), 187–194. Suche in Google Scholar
[2] T. Denkinger, An automata characterisation for multiple context-free languages, Developments in Language Theory, Lecture Notes in Comput. Sci. 9840, Springer, Berlin (2016), 138–150. 10.1007/978-3-662-53132-7_12Suche in Google Scholar
[3] M. J. Dunwoody, The accessibility of finitely presented groups, Invent. Math. 81 (1985), no. 3, 449–457. 10.1007/BF01388581Suche in Google Scholar
[4] R. H. Gilman, R. P. Kropholler and S. Schleimer, Groups whose word problems are not semilinear, Groups Complex. Cryptol. 10 (2018), no. 2, 53–62. 10.1515/gcc-2018-0010Suche in Google Scholar
[5]
M.-C. Ho,
The word problem of
[6] J. E. Hopcroft and J. D. Ullman, Formal Languages and Their Relation to Automata, Addison-Wesley, Reading, 1969. Suche in Google Scholar
[7] R. C. Lyndon and P. E. Schupp, Combinatorial Group Theory, Classics Math., Springer, Berlin, 2001. 10.1007/978-3-642-61896-3Suche in Google Scholar
[8] D. E. Muller and P. E. Schupp, Context-free languages, groups, the theory of ends, second-order logic, tiling problems, cellular automata, and vector addition systems, Bull. Amer. Math. Soc. (N. S.) 4 (1981), no. 3, 331–334. 10.1090/S0273-0979-1981-14904-1Suche in Google Scholar
[9] C. Pollard, Generalized phrase structure grammars, head grammars, and natural language, Ph.D. thesis, Stanford University, 1984. Suche in Google Scholar
[10] S. Salvati, Multiple context-free grammars. Course 1: Motivations and formal definition, 2011. Suche in Google Scholar
[11]
S. Salvati,
MIX is a 2-MCFL and the word problem in
[12] H. Seki, T. Matsumura, M. Fujii and T. Kasami, On multiple context-free grammars, Theoret. Comput. Sci. 88 (1991), no. 2, 191–229. 10.1016/0304-3975(91)90374-BSuche in Google Scholar
[13] J. Stallings, Group Theory and Three-dimensional Manifolds, Yale University Press, New Haven, 1971. Suche in Google Scholar
© 2019 Walter de Gruyter GmbH, Berlin/Boston
Artikel in diesem Heft
- Frontmatter
- Closure properties in the class of multiple context-free groups
- Cryptanalysis of a hash function, and the modular subset sum problem
- Some applications of arithmetic groups in cryptography
- An improved version of the AAG cryptographic protocol
- Conjugacy search problem and the Andrews–Curtis conjecture
Artikel in diesem Heft
- Frontmatter
- Closure properties in the class of multiple context-free groups
- Cryptanalysis of a hash function, and the modular subset sum problem
- Some applications of arithmetic groups in cryptography
- An improved version of the AAG cryptographic protocol
- Conjugacy search problem and the Andrews–Curtis conjecture
