Closure properties in the class of multiple context-free groups

DOI10.1515/gcc-2019-2004OpenAlexW2971550412MaRDI QIDQ2304867

Robert Kropholler, Davide Spriano

Publication date: 13 March 2020

Published in: Groups, Complexity, Cryptology (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1709.02478

zbMATH Keywords

word problemgroup theoryformal languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Related Items (2)

Groups whose word problems are accepted by abelian \(G\)-automata ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• The accessibility of finitely presented groups
• On multiple context-free grammars
• Combinatorial group theory.
• The word problem of \(\mathbb{Z}^n\) is a multiple context-free language
• Groups whose word problems are not semilinear
• MIX is a 2-MCFL and the word problem in \(\mathbb{Z}^2\) is captured by the IO and the OI hierarchies
• An Automata Characterisation for Multiple Context-Free Languages
• Context-free languages, groups, the theory of ends, second-order logic, tiling problems, cellular automata, and vector addition systems

This page was built for publication: Closure properties in the class of multiple context-free groups