Infinite Lyndon words
From MaRDI portal
Publication:1322121
DOI10.1016/0020-0190(94)90016-7zbMath0803.68093MaRDI 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
Related Items
Generic Algorithms for Factoring Strings, Unnamed Item, On infinite prefix normal words, Generalized Lyndon factorizations of infinite words, Lyndon words and Fibonacci numbers, Infinite self-shuffling words, Quasiperiodic Sturmian words and morphisms, Lyndon words and singular factors of sturmian words, Viennot factorization of infinite words, Lyndon factorization of the Prouhet words., Reprint of: ``\(\omega\)-Lyndon words, Reprint of: ``Generalized Lyndon factorizations of infinite words, \( \omega \)-Lyndon words, Some properties of the Tribonacci sequence, Conjugacy of morphisms and Lyndon decomposition of standard Sturmian words, On generalized Lyndon words, A coloring problem for infinite words, Smooth words on 2-letter alphabets having same parity, The -transformation with a hole at 0, Transfinite Lyndon Words, Look and Say Fibonacci
Cites Work
