Pages that link to "Item:Q1001907"
From MaRDI portal
The following pages link to On the descriptional complexity of scattered context grammars (Q1001907):
Displayed 3 items.
- Scattered context grammars generate any recursively enumerable language with two nonterminals (Q407598) (← links)
- Nonterminal complexity of one-sided random context grammars (Q2428495) (← links)
- Scattered Context Grammars with One Non-Context-Free Production are Computationally Complete (Q5164863) (← links)