Intertwined infinite binary words

Infinite Lyndon words

✍ Rani Siromoney; Lisa Mathew; V.R. Dare; K.G. Subramanian 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 321 KB

Infinite self-similar words

✍ Jarosł;aw Grytczuk 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 319 KB

The words we consider in this paper are defined by some self-similarity conditions which in particular are satisfied by the well-known Fibonacci word f= 1011010110110 .... We discuss structural as well as asymptotical properties of these words.

A Note on Intertwines of Infinite Graphs

✍ B. Oporowski 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 224 KB

We present a construction of two infinite graphs \(G_{1}, G_{2}\) and of an infinite set of graphs such that \(\mathscr{F}\) is an antichain with respect to the minor relation and, for every graph \(G\) in \(\mathscr{F}\), both \(G_{1}\) and \(G_{2}\) are subgraphs of \(G\) but no graph obtained fro

Periods and Binary Words

✍ Vesa Halava; Tero Harju; Lucian Ilie 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 102 KB

We give an elementary short proof for a well known theorem of Guibas and Odlyzko stating that the sets of periods of words are independent of the alphabet size. As a consequence of our constructive proof, we obtain a linear time algorithm which, given a word, computes a binary one with the same peri

Viennot factorization of infinite words

✍ Guy Melançon 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 462 KB

Example 3. Let A be totally ordered by <. One may extend this order lexicographically to the whole set 2 This is the name Lothaire gives them [ 41. Viennot [ 121 modestly calls them regular.

Infinite words and biprefix codes

✍ Giuseppe Pirillo; DédiéàA. Saoudi 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 265 KB