✦ LIBER ✦

Structural complexity of context-free languages

✍ Scribed by K. Kobayashi

Book ID: 114036852
Publisher: Elsevier Science
Year: 1971
Weight: 520 KB
Volume: 18
Category: Article
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(71)90410-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Context-free complexity of finite langua

Context-free complexity of finite languages

✍ W. Bucher; H.A. Maurer; K. Culik II 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 1003 KB

Kolmogorov Complexity and Deterministic

Kolmogorov Complexity and Deterministic Context-Free Languages

✍ Glier, Oliver 📂 Article 📅 2003 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 107 KB

Spatial complexity of recognition of con

Spatial complexity of recognition of context-free languages

✍ V. A. Nepomnyashchii 📂 Article 📅 1976 🏛 Springer US 🌐 English ⚖ 512 KB

On the Tape Complexity of Deterministic

On the Tape Complexity of Deterministic Context-Free Languages

✍ Sudborough, I. H. 📂 Article 📅 1978 🏛 Association for Computing Machinery 🌐 English ⚖ 691 KB

Complexity and unambiguity of context-fr

Complexity and unambiguity of context-free grammars and languages

✍ J. Gruska 📂 Article 📅 1971 🏛 Elsevier Science ⚖ 754 KB

On the context-free production complexit

On the context-free production complexity of finite languages

✍ Zsolt Tuza 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 696 KB

The following problem is investigated. Let L be a given finite language, LcL,= {ub: I ~o,bsn, of/~}. 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'/log n) is proved, and languages satisfying c(L) = IL) are charac