Enumeration of Context-Free Languages and Related Structures

In this paper, we consider the enumeration of context-free languages. In particular, for any reasonable descriptional complexity measure for context-free grammars, we demonstrate that the exact quantity of context-free languages of size ¢ is uncomputable. Nevertheless, we are able to give upper and lower bounds on the number of such languages. We also generalize our results to enumerate predicates that are recursively enumerable or co-recursively enumerable.

• Type: Journal
• Year: 2007
• Where: JALC
• Authors: Michael Domaratzki, Alexander Okhotin, Jeffrey Shallit
• Keywords: Context-free Grammars, Context-free Languages, JALC 2007, Reasonable Descriptional Complexity