### Abstract

The following problem is investigated. Let L be a given finite language, L⊂L_{n} = ab: 1≤a,b≤n, a≠b. Determine the minimal natural number c(L) such that L can be generated by c(L) context-free productions. Among others, max c(L) = O(n^{2}/log n) is proved, and languages satisfying c(L) = |L|are characterized.

Original language | English |
---|---|

Pages (from-to) | 293-304 |

Number of pages | 12 |

Journal | Discrete Applied Mathematics |

Volume | 18 |

Issue number | 3 |

DOIs | |

Publication status | Published - Dec 1987 |

### Fingerprint

### ASJC Scopus subject areas

- Discrete Mathematics and Combinatorics
- Applied Mathematics