Closure Properties in the Class of Multiple Context Free Groups

2017/09/07 by Kropholler, Robert P., Spriano, Davide · 2 citations
#FOS: Computer and information sciences #FOS: Mathematics #Formal Languages and Automata Theory (cs.FL) #Group Theory (math.GR)

paper · doi:10.48550/arxiv.1709.02478

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.

Cited by

• Permutation closure for multiple context-free languages
• A substitution lemma for multiple context-free languages

Related

• A note on Context Sensitive languages and Word Problems
• The Word Problem of ℤⁿ Is a Multiple Context-Free Language
• Groups whose word problems are not semilinear
• An automata theoretic approach to the generalized word problem in graphs of groups
• Context-Free Groups and Bass-Serre Theory