A REGULARITY CONDITION FOR CONTEXT-FREE GRAMMARS

DOI10.1142/S0129054108005991zbMath1156.68027OpenAlexW2061465837MaRDI QIDQ3526539

Beatrice Palano

Publication date: 25 September 2008

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054108005991

zbMATH Keywords

complexity measure

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Self-embedded context-free grammars with regular counterparts
• On certain formal properties of grammars
• On Context-Free Languages
• On the index of a context-free grammar and language
• An analog of a theorem about context-free languages
• A few remarks on the index of context-free grammars and languages

This page was built for publication: A REGULARITY CONDITION FOR CONTEXT-FREE GRAMMARS