Closure properties in the class of multiple context-free groups

DOI10.1515/GCC-2019-2004MaRDI QIDQ2304867zbMATH OpenOpenAlexFDO

Authors 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

formal languagesgroup theoryword problem

Mathematics Subject Classification ID

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

Cites work

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

Cited in

(5)

• scientific article; zbMATH DE number 7456062 (Why is no real title available?)
• Groups whose word problems are accepted by abelian G-automata
• Closure Properties in the Class of Multiple Context Free Groups
• Free products of semigroups and monoids with a deterministic context-free word problem
• Commutative semigroups with a context-free word problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2304867)