Infinite Lyndon words

DOI10.1016/0020-0190(94)90016-7zbMath0803.68093OpenAlexW2000514486MaRDI QIDQ1322121

Lisa Mathew, K. G. Subramanian, Rani Siromoney, V. Rajkumar Dare

Publication date: 8 January 1995

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(94)90016-7

zbMATH Keywords

infinite wordsLyndon wordsCantor spacequeue automata

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45)

Related Items (24)

Some properties of the Tribonacci sequence ⋮ Closed Ziv-Lempel factorization of the \(m\)-bonacci words ⋮ Conjugacy of morphisms and Lyndon decomposition of standard Sturmian words ⋮ Transfinite Lyndon Words ⋮ A characterization of binary morphisms generating Lyndon infinite words ⋮ Viennot factorization of infinite words ⋮ ZIV-LEMPEL AND CROCHEMORE FACTORIZATIONS OF THE GENERALIZED PERIOD-DOUBLING WORD ⋮ Quasiperiodic Sturmian words and morphisms ⋮ Lyndon words and Fibonacci numbers ⋮ On generalized Lyndon words ⋮ Reprint of: ``\(\omega\)-Lyndon words ⋮ Reprint of: ``Generalized Lyndon factorizations of infinite words ⋮ Infinite self-shuffling words ⋮ Lyndon factorization of the Prouhet words. ⋮ Look and Say Fibonacci ⋮ A coloring problem for infinite words ⋮ The -transformation with a hole at 0 ⋮ Generic Algorithms for Factoring Strings ⋮ Smooth words on 2-letter alphabets having same parity ⋮ \( \omega \)-Lyndon words ⋮ On infinite prefix normal words ⋮ Generalized Lyndon factorizations of infinite words ⋮ Unnamed Item ⋮ Lyndon words and singular factors of sturmian words

Cites Work

• Unnamed Item
• Unnamed Item
• QRT FIFO automata, breadth-first grammars and their relations
• Factorizing words over an ordered alphabet

This page was built for publication: Infinite Lyndon words