Grammars with Context Conditions and Their Applications

DOI10.1002/0471736562zbMath1087.68045OpenAlexW2497821127MaRDI QIDQ5706505

Martin Švec, Alexander Meduna

Publication date: 7 November 2005

Full work available at URL: https://doi.org/10.1002/0471736562

zbMATH Keywords

grammarsstring-rewritingcontext-conditions

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Grammars and rewriting systems (68Q42)

Related Items (12)

Descriptional complexity of semi-conditional grammars ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On restricted context-free grammars ⋮ Computational completeness of simple semi-conditional insertion-deletion systems of degree (2,1) ⋮ Descriptional complexity of multi-parallel grammars ⋮ A note on the descriptional complexity of semi-conditional grammars ⋮ A Note on the Generative Power of Some Simple Variants of Context-Free Grammars Regulated by Context Conditions ⋮ Improved descriptional complexity results on generalized forbidding grammars ⋮ On context-free rewriting with a simple restriction and its computational completeness ⋮ One-sided random context grammars ⋮ Generalized one-sided forbidding grammars

This page was built for publication: Grammars with Context Conditions and Their Applications