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

On the size of the alphabet and the subword complexity of square-free DOI languages

โœ Scribed by A. Ehrenfeucht; G. Rozenberg

Book ID
110560095
Publisher
Springer
Year
1983
Tongue
English
Weight
317 KB
Volume
26
Category
Article
ISSN
0037-1912

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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