Pages that link to "Item:Q1647858"
From MaRDI portal
The following pages link to The word problem of \(\mathbb{Z}^n\) is a multiple context-free language (Q1647858):
Displayed 7 items.
- Comparing consecutive letter counts in multiple context-free languages (Q831122) (← links)
- IDL-PMCFG, a grammar formalism for describing free word order languages (Q2093024) (← links)
- \(O_n\) is an \(n\)-MCFL (Q2121469) (← links)
- Closure properties in the class of multiple context-free groups (Q2304867) (← links)
- Groups whose word problems are not semilinear (Q2317163) (← links)
- (Q5021232) (← links)
- Self-avoiding walks and multiple context-free languages (Q5886265) (← links)