On context-free rewriting with a simple restriction and its computational completeness

DOI10.1051/ITA/2009002zbMath1171.68017OpenAlexW1986228843MaRDI QIDQ3625698

Tomáš Masopust, Alexander Meduna

Publication date: 6 May 2009

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92921

zbMATH Keywords

formal languagescontext-free grammarderivation restrictiongenerative powercontext-free rewriting system

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (2)

On restricted context-free grammars ⋮ Simple restriction in context-free rewriting

Cites Work

• A variant of random context grammars: Semi-conditional grammars
• Some restrictive devices for context-free grammars
• Grammars with Context Conditions and Their Applications
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On context-free rewriting with a simple restriction and its computational completeness