Search results
From MaRDI portal
- unranking fixed-density necklaces and Lyndon words 2019-09-10 Paper Finding the largest fixed-density necklace and Lyndon word 2017-06-13 Paper...10 bytes (16 words) - 18:03, 6 October 2023
- 2011-08-23 Paper Limit Law of the Length of the Standard Right Factor of a Lyndon Word 2007-05-15 Paper...10 bytes (18 words) - 19:52, 6 October 2023
- 2007-05-30 Paper Limit Law of the Length of the Standard Right Factor of a Lyndon Word 2007-05-15 Paper Coexistence in two-type first-passage percolation models...10 bytes (17 words) - 13:31, 28 January 2024
- Computing k-th Lyndon Word and Decoding Lexicographically Minimal de Bruijn Sequence 2014-06-30 Paper Extracting powers and periods in a word from its runs...10 bytes (16 words) - 02:44, 10 December 2023
- and Lyndon words in colexicographic and binary reflected Gray code order 2017-11-09 Paper Finding the largest fixed-density necklace and Lyndon word 2017-06-13...10 bytes (16 words) - 09:31, 6 October 2023
- space, and vice versa 2024-04-02 Paper Computing longest Lyndon subsequences and longest common Lyndon subsequences 2024-03-25 Paper Toward a Definitive Compressibility...10 bytes (17 words) - 09:05, 7 October 2023
- Computing k-th Lyndon Word and Decoding Lexicographically Minimal de Bruijn Sequence 2014-06-30 Paper Extracting powers and periods in a word from its runs...10 bytes (17 words) - 18:22, 9 December 2023
- decidable 2022-08-18 Paper A characterization of binary morphisms generating Lyndon infinite words 2022-05-20 Paper On sets of indefinitely desubstitutable...10 bytes (16 words) - 12:19, 11 December 2023
- Parikh word representable graphs 2021-07-07 Paper Some results on Parikh word representable graphs and partitions 2019-06-21 Paper Infinite Lyndon words...10 bytes (16 words) - 10:30, 7 October 2023
- conjugaison et arbre des mots de Lyndon de longueur bornée. (Generation of a section of conjugation classes and trees of Lyndon words of bounded length) 1988-01-01...10 bytes (18 words) - 18:21, 9 December 2023
- chains 1995-05-15 Paper Optimal word chains for the Thue-Morse word 1989-01-01 Paper Enumeration of factors in the Thue-Morse word 1989-01-01 Paper Addition...10 bytes (17 words) - 00:40, 10 December 2023
- Algebraic properties of word equations 2015-05-06 Paper Words with unbounded periodicity complexity 2014-12-12 Paper Universal Lyndon Words 2014-10-14 Paper...10 bytes (17 words) - 17:57, 9 December 2023
- an inverse Lyndon factorization and other properties 2021-03-09 Paper https://portal.mardi4nfdi.de/entity/Q5146649 2021-01-26 Paper Lyndon words versus...10 bytes (19 words) - 19:26, 9 December 2023
- sequences 2023-11-16 Paper On extended special factors of a word 2023-07-28 Paper Checking whether a word is Hamming-isometric in linear time 2022-09-27 Paper...10 bytes (17 words) - 05:01, 9 December 2023
- INTRICACIES OF SIMPLE WORD EQUATIONS: AN EXAMPLE 2010-01-29 Paper https://portal.mardi4nfdi.de/entity/Q3396577 2009-09-19 Paper On systems of word equations over...10 bytes (16 words) - 15:49, 6 October 2023
- Date of Publication Type A characterization of binary morphisms generating Lyndon infinite words 2022-05-20 Paper If a DOL language is k-power free then it...10 bytes (16 words) - 12:01, 9 December 2023
- 2015-04-23 Paper Universal Lyndon Words 2014-10-14 Paper Cyclic Complexity of Words 2014-10-14 Paper Suffix array and Lyndon factorization of a text 2014-09-05...10 bytes (16 words) - 19:22, 11 December 2023
- repetitions by Lyndon trees 2017-10-05 Paper The “Runs” Theorem 2017-09-25 Paper Inferring strings from Lyndon factorization 2017-09-07 Paper Faster Lyndon factorization...10 bytes (16 words) - 10:04, 6 October 2023
- and directed acyclic word graph construction for multiple texts 2020-04-01 Paper On the size of the smallest alphabet for Lyndon trees 2019-10-07 Paper...10 bytes (16 words) - 17:11, 24 September 2023
- The satisfiability of word equations: decidable and undecidable theories 2018-10-23 Paper On the Complexity of Solving Restricted Word Equations 2018-09-20...10 bytes (16 words) - 05:33, 7 October 2023
