Context-free grammars with selective rewriting

DOI10.1007/BF00288645zbMath0445.68058MaRDI QIDQ1145511

Derick Wood, Grzegorz Rozenberg

Publication date: 1980

Published in: Acta Informatica (Search for Journal in Brave)

zbMATH Keywords

context-free grammarsrewriting systemsregulated derivationsselective substitution grammarsL- languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (9)

Adding global forbidding context to context-free grammars ⋮ Transductions and the parallel generation of languages^† ⋮ A pumping result for 2-context-free languages ⋮ Context-free like restrictions on selective rewriting ⋮ Hierarchy of k-context-free languages part 1 ⋮ Hierarchy ofk-context-free languages ⋮ Closure properties of selective substitution grammars part I ⋮ Multi grammars ⋮ Closure properties of selective substitution grammars

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Pure grammars
• Pure grammars and pure languages†
• A universal context-free grammar
• A note on universal grammars
• Comments on universal and left universal grammars, context-sensitive languages, and context-free grammar forms
• On 0L-Languages

This page was built for publication: Context-free grammars with selective rewriting