Pages that link to "Item:Q1001907"
From MaRDI portal
The following pages link to On the descriptional complexity of scattered context grammars (Q1001907):
Displaying 13 items.
- One-sided random context grammars with a limited number of right random context rules (Q385971) (← links)
- Scattered context grammars generate any recursively enumerable language with two nonterminals (Q407598) (← links)
- Scattered context grammars that erase nonterminals in a generalized \(k\)-limited way (Q1006344) (← links)
- An infinite hierarchy of language families generated by scattered context grammars with \(n\)-limited derivations (Q1019169) (← links)
- Coincidental extension of scattered context languages (Q1424350) (← links)
- Terminating left-hand sides of scattered context productions M. Nivat (Q1566740) (← links)
- Generative power of three-nonterminal scattered context grammars (Q1583096) (← links)
- On the descriptional complexity of some rewriting mechanisms regulated by context conditions (Q1763724) (← links)
- Syntactic complexity of scattered context grammars (Q1892719) (← links)
- Nonterminal complexity of one-sided random context grammars (Q2428495) (← links)
- Canonical scattered context generators of sentences with their parses (Q2465627) (← links)
- Uniform generation of languages by scattered context grammars (Q2711327) (← links)
- Scattered Context Grammars with One Non-Context-Free Production are Computationally Complete (Q5164863) (← links)
