✦ LIBER ✦

Relatively f-disjunctive languages

✍ Scribed by Y. Q. Guo; C. M. Reis; G. Thierrin

Book ID: 110560340
Publisher: Springer
Year: 1988
Tongue: English
Weight: 335 KB
Volume: 37
Category: Article
ISSN: 0037-1912
DOI: 10.1007/bf02573141

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on f-disjunctive languages

✍ C. M. Reis 📂 Article 📅 1987 🏛 Springer 🌐 English ⚖ 261 KB

Disjunctive decomposition of languages

✍ Y.Q. Guo; G.W. Xu; G. Thierrin 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 282 KB

Disjunctive splittability of languages

✍ Masashi Katsura 📂 Article 📅 1988 🏛 Springer 🌐 English ⚖ 491 KB

Quasi-completely right disjunctive langu

Quasi-completely right disjunctive languages

✍ S. S. Yu 📂 Article 📅 1990 🏛 Springer 🌐 English ⚖ 512 KB

Some properties of the disjunctive langu

Some properties of the disjunctive languages contained inQ

✍ Zheng-Zhu Li; Y. S. Tsai 📂 Article 📅 2010 🏛 Springer-Verlag 🌐 English ⚖ 307 KB

Language-theoretic complexity of disjunc

Language-theoretic complexity of disjunctive sequences

✍ Cristian Calude; Yu Sheng 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 438 KB

A sequence over an alphabet Z is called disjunctirr if it contains all possible finite strings over .Z as its substrings. Disjunctive sequences have been recently studied in various contexts. They abound in both category and measure senses. In this paper we measure the complexity of a sequence x by