✦ LIBER ✦

The number of minimal words chains computing the Thue-Morse word

✍ Scribed by Mireille Bousquet-Mélou

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 659 KB
Volume: 44
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(92)90186-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On bispecial factors of the Thue–Morse w

On bispecial factors of the Thue–Morse word

✍ Aldo de Luca; Licia Mione 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 406 KB

On computing the number of code words wi

On computing the number of code words with minimum weight for cyclic codes

✍ Masami Mohri; Masakatsu Morii 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 264 KB 👁 2 views

The weight distribution is an important parameter that determines the performance of a code. The minimum distance and the number of corresponding codes that can be derived from the weight distribution, greatly affect the performance of the code. The decoding error probability and other performance m

On the number of C∞-words of each length

✍ William D Weakley 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 448 KB

Tight lower bounds on the length of word

Tight lower bounds on the length of word chains

✍ Ingo Althöfer 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 113 KB

An algorithm for computing the number of

An algorithm for computing the number of the minimal paths in digital images

✍ P.P. Das 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 450 KB

The Computation of Partial Recursive Wor

The Computation of Partial Recursive Word-Functions Without Read Instructions

✍ Holger Petersen 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 422 KB 👁 1 views

## Abstract In this note we consider register‐machines with symbol manipulation capabilities. They can form words over a given alphabet in their registers by appending symbols to the strings already stored. These machines are similar to Post's normal systems and the related machine‐models discussed