✦ LIBER ✦

On the subword complexity of m-free D0L languages

✍ Scribed by A. Ehrenfeucht; G. Rozenberg

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the subword complexity of square-free

✍ A. Ehrenfeucht; G. Rozenberg 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 890 KB

On the subword complexity of locally cat

✍ A. Ehrenfeucht; G. Rozenberg 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 226 KB

On the size of the alphabet and the subw

✍ A. Ehrenfeucht; G. Rozenberg 📂 Article 📅 1983 🏛 Springer 🌐 English ⚖ 317 KB

Subword complexity of uniform D0L words

✍ Ilya Goldstein 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 329 KB

On the subword complexity of DOL languag

✍ A. Ehrenfeucht; G. Rozenberg 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 660 KB

The D0L-ness for context-free languages

✍ M. Linna 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 407 KB