✦ LIBER ✦

Subword complexity of uniform D0L words over finite groups

✍ Scribed by Ilya Goldstein

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the subword complexity of m-free D0L

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

Arithmetical complexity of symmetric D0L

✍ A.E. Frid 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 173 KB

We characterize and count words which occur in arithmetical subsequences of ÿxed points of symmetric morphisms.

The Complexity of Solving Equations over

✍ Mikael Goldmann; Alexander Russell 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 112 KB