✦ LIBER ✦

Combinatorial properties of smooth infinite words

✍ Scribed by S. Brlek; S. Dulucq; A. Ladouceur; L. Vuillon

Book ID: 108281161
Publisher: Elsevier Science
Year: 2006
Tongue: English
Weight: 224 KB
Volume: 352
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2005.12.003

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Some combinatorial properties of infinit

Some combinatorial properties of infinite words and applications to semigroup theory

✍ Giuseppe Pirillo; Stefano Varricchio 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 560 KB

This paper is concerned with finiteness conditions for finitely generated semigroups. First, we present a combinatorial result on infinite sequences from which an alternative proof of a theorem of Restivo and Reutenauer follows: a finitely generated semigroup is finite if and only if it is periodic

Some combinatorial properties of Sturmia

Some combinatorial properties of Sturmian words

✍ Aldo de Luca; Filippo Mignosi 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 950 KB

Infinite words and permutation propertie

Infinite words and permutation properties

✍ J. Justin; G. Pirillo 📂 Article 📅 1990 🏛 Springer 🌐 English ⚖ 324 KB

On a combinatorial property of Sturmian

On a combinatorial property of Sturmian words

✍ J. Justin; G. Pirillo 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 543 KB

Corrigendum to “Infinite words and permu

Corrigendum to “Infinite words and permutation properties”

✍ J. Justin; G. Pirillo 📂 Article 📅 1991 🏛 Springer 🌐 English ⚖ 21 KB

A combinatorial property of the factor p

A combinatorial property of the factor poset of a word

✍ Arturo Carpi; Aldo de Luca 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 77 KB

We prove the following interesting combinatorial property of the poset of the factors of a word. Let w be a word and n = G w + 2, where G w is the maximal length of a repeated factor of w. If v is any word such that the posets of the factors of v and of w up to length n are isomorphic, then v can be