๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the Tape Complexity of Deterministic Context-Free Languages

โœ Scribed by Sudborough, I. H.


Book ID
111876419
Publisher
Association for Computing Machinery
Year
1978
Tongue
English
Weight
691 KB
Volume
25
Category
Article
ISSN
0004-5411

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


On the context-free production complexit
โœ 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