✦ LIBER ✦

Infinite words and biprefix codes

✍ Scribed by Giuseppe Pirillo; DédiéàA. Saoudi

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 265 KB
Volume: 50
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(94)00053-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On some factorizations of infinite words

On some factorizations of infinite words by elements of codes

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

We show that an infinite word s satisfies s = uoutu2 . . . with all ui being different nonempty words and their set being a biprefix code if and only if s is not ultimately periodic. We give also related results, considering in particular arbitrary codes, infix codes and the case of two-sided infini

Codes, simplifying words, and open set c

Codes, simplifying words, and open set condition

✍ Ludwig Staiger 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 473 KB

Fuzzy regular languages over finite and

Fuzzy regular languages over finite and infinite words

✍ Werner Kuich; George Rahonis 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 301 KB

PRIMITIVE WORDS IN AN INFINITE ABSTRACT

PRIMITIVE WORDS IN AN INFINITE ABSTRACT ALPHABET

✍ H. A. Pogorzelski 📂 Article 📅 1964 🏛 John Wiley and Sons 🌐 English ⚖ 265 KB

Effectiveness for infinite variable word

Effectiveness for infinite variable words and the Dual Ramsey Theorem

✍ Joseph S. Miller; Reed Solomon 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 173 KB

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