A note on a problem in the theory of grammatical complexity
From MaRDI portal
Publication:1157180
DOI10.1016/0304-3975(81)90050-5zbMath0469.68082OpenAlexW2086147752MaRDI QIDQ1157180
Publication date: 1981
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(81)90050-5
Related Items (6)
Generating all permutations by context-free grammars in Chomsky normal form ⋮ Generating all permutations by context-free grammars in Greibach normal form ⋮ On the compressibility of finite languages and formal proofs ⋮ GENERATING ALL CIRCULAR SHIFTS BY CONTEXT-FREE GRAMMARS IN GREIBACH NORMAL FORM ⋮ On the cover complexity of finite languages ⋮ Context-free complexity of finite languages
Cites Work
This page was built for publication: A note on a problem in the theory of grammatical complexity
