Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/de-gruyter/closure-properties-in-the-class-of-multiple-context-free-groups-KKb0jnokVv
References (16)
-
D. Muller, P. Schupp (1981)
Context-free languages, groups, the theory of ends, second-order logic, tiling problems, cellular automata, and vector addition systemsBulletin of the American Mathematical Society, 4
-
C. Pollard (1984)
Generalized phrase structure grammars, head grammars, and natural language -
Meng-CheTurboHo (2017)
The Word Problem of $\mathbb{Z}^n$ Is a Multiple Context-Free Language -
Thomas Spencer (1993)
Context-free languagesSIGACT News, 24
-
Daniel Götzmann (2007)
Multiple Context-Free Grammars -
Sylvain Salvati (2015)
MIX is a 2-MCFL and the word problem in Z2 is captured by the IO and the OI hierarchiesJ. Comput. Syst. Sci., 81
-
H. Seki, T. Matsumura, M. Fujii, T. Kasami (1991)
On Multiple Context-Free GrammarsTheor. Comput. Sci., 88
-
(1962)
Context-free grammars and pushdown storage -
R. Gilman, Robert Kropholler, S. Schleimer (2018)
Groups whose word problems are not semilinearGroups Complexity Cryptology, 10
-
J. Hopcroft, J. Ullman (1969)
Formal languages and their relation to automata -
M. Ho (2018)
The word problem of ℤ n is a multiple context-free languageGroups Complexity Cryptology, 10
-
G. Gazdar, Ewan Klein, G. Pullum, I. Sag (1985)
Generalized Phrase Structure Grammar -
Tobias Denkinger (2016)
An Automata Characterisation for Multiple Context-Free Languages -
J. Stallings (1971)
Group Theory and Three-dimensional Manifolds -
M. Dunwoody (1985)
The accessibility of finitely presented groupsInventiones mathematicae, 81
-
R. Lyndon, P. Schupp (1977)
Combinatorial Group Theory
- Publisher
- de Gruyter
- Copyright
- © 2019 Walter de Gruyter GmbH, Berlin/Boston
- ISSN
- 1869-6104
- eISSN
- 1869-6104
- DOI
- 10.1515/gcc-2019-2004
- Publisher site
- See Article on Publisher Site
Abstract
AbstractWe show that the class of groups with k-multiple context-free word problem is closed under graphs of groups with finite edge groups.
Journal
Groups Complexity Cryptology – de Gruyter
Published: May 1, 2019