Pages that link to "Item:Q2317163"

The following pages link to Groups whose word problems are not semilinear (Q2317163):

Displaying 7 items.

• The word problem of \(\mathbb{Z}^n\) is a multiple context-free language (Q1647858) (← links)
• Non-finitely generated maximal subgroups of context-free monoids (Q2099288) (← links)
• Closure properties in the class of multiple context-free groups (Q2304867) (← links)
• MIX is a 2-MCFL and the word problem in \(\mathbb{Z}^2\) is captured by the IO and the OI hierarchies (Q2353402) (← links)
• On the word problem for free products of semigroups and monoids (Q2693366) (← links)
• (Q5021232) (← links)
• Conjugacy languages in virtual graph products (Q6052936) (← links)