The following pages link to (Q3471701):
Displaying 9 items.
- The Dyck language \(D_ 1^{'*}\) is not generated by any matrix grammar of finite index (Q1099632) (← links)
- Simple reductions between \(D0L\) language and sequence equivalence problems (Q1208490) (← links)
- Cancellation in context-free languages: enrichment by reduction (Q1325840) (← links)
- On the computing powers of \(\mathcal{L}\)-reductions of insertion languages (Q1998879) (← links)
- \(\mathcal{L}\)-reduction computation revisited (Q2170281) (← links)
- (Q3126160) (← links)
- Coordinated pair systems ; part II : sparse structure of Dyck words and Ogden's lemma (Q3780467) (← links)
- Normal forms for phrase-structure grammars (Q3991298) (← links)
- (Q4281522) (← links)
