Closure properties in the class of multiple context-free groups (Q2304867): Difference between revisions

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