On the context-free production complexity of finite languages

Research output: Contribution to journalArticle

7 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)293-304
Number of pages12
JournalDiscrete Applied Mathematics
Issue number3
Publication statusPublished - Dec 1987


ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Cite this