✦ LIBER ✦

On the complexity of a family of -context-free sequences

✍ Scribed by Marion Le Gonidec

Book ID: 113927558
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 268 KB
Volume: 414
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2011.09.022

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the complexity of regulated context-f

On the complexity of regulated context-free rewriting

✍ A.B. Cremers; O. Mayer; K. Weiss 📂 Article 📅 1974 🏛 Elsevier Science ⚖ 390 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

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

Remarks on the complexity of an invarian

Remarks on the complexity of an invariant of context-free grammars

✍ Thiet-Dung Huynh 📂 Article 📅 1982 🏛 Springer-Verlag 🌐 English ⚖ 434 KB

On the complexity of parallel parsing of

On the complexity of parallel parsing of general context-free languages

✍ Wojciech Rytter 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 409 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