A lower-bound for the number of productions required for a certain class of languages
From MaRDI portal
Publication:1054160
DOI10.1016/0166-218X(83)90064-1zbMath0518.68040OpenAlexW2010270097MaRDI QIDQ1054160
Peter Eades, Gordon Rose, Brian Alspach
Publication date: 1983
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(83)90064-1
Related Items (8)
Generating all permutations by context-free grammars in Chomsky normal form ⋮ Generating all permutations by context-free grammars in Greibach normal form ⋮ On the context-free production complexity of finite languages ⋮ On the compressibility of finite languages and formal proofs ⋮ On the complexity of the smallest grammar problem over fixed alphabets ⋮ GENERATING ALL CIRCULAR SHIFTS BY CONTEXT-FREE GRAMMARS IN GREIBACH NORMAL FORM ⋮ Brian Alspach and his work ⋮ On the cover complexity of finite languages
Cites Work
This page was built for publication: A lower-bound for the number of productions required for a certain class of languages
