Homogeneous grammars with a reduced number of non-context-free products

DOI10.1016/S0020-0190(01)00224-1zbMath1046.68065OpenAlexW1977268879MaRDI QIDQ1847383

Alexander Meduna, D. Kolář

Publication date: 24 June 2003

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(01)00224-1

zbMATH Keywords

phrase-structure grammar

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (2)

Descriptional Complexity Of Generalized Forbidding Grammars ⋮ Unnamed Item

Cites Work

• How to Make Arbitrary Grammars Look Like Context-Free Grammars
• Uniform rewriting based on permutations
• One-sided and two-sided context in formal grammars
• Some remarks on derivations in general rewriting systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Homogeneous grammars with a reduced number of non-context-free products