Lower bounds for context-free grammars
type: Item
instance of: scholarly article
title: Lower bounds for context-free grammars
zbMATH Open document ID: 1260.68204
author: Yuval Filmus
published in: Information Processing Letters
publication date: 2013-04-04T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 6150458
zbMATH Keywords: formal languages
zbMATH Keywords: context-free grammars
zbMATH Keywords: lower bounds
MaRDI profile type: Publication
full work available at URL: j.ipl.2011.06.006
OpenAlex ID: W2055190789
cites work: Q5437181
cites work: The Smallest Grammar Problem
cites work: Generating all permutations by context-free grammars in Chomsky normal form
cites work: Generating all permutations by context-free grammars in Greibach normal form
cites work: Q3505125
cites work: GENERATING ALL CIRCULAR SHIFTS BY CONTEXT-FREE GRAMMARS IN GREIBACH NORMAL FORM
cites work: Complexity of normal form grammars
DOI: 10.1016/J.IPL.2011.06.006
description: scientific article; zbMATH DE number 6150458