The following problem is investigated. Let L be a given finite language, L⊂Ln = 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(n2/log n) is proved, and languages satisfying c(L) = |L|are characterized.
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics
- Applied Mathematics