Results 121 to 130 of about 1,338,709 (133)

Sequences of Lyndon Words

1990
A code has bounded synchronization delay if there exists an integer s such that at most s consecutive bits are required to establish word synchronization in any message. The set of Lyndon words of length n, Λ n , is the set obtained by choosing those strings which are lexicographically least in the primitive equivalence classes determined by cyclic ...
openaire   +1 more source

The set of Lyndon words is not context-free

Bull. EATCS, 1997
Summary: A word is primitive if it is not a proper power of a shorter word. A Lyndon word is a primitive word which is minimal under cyclic permutation. The status of the languages \(Q\) of primitive words and \(L\) of Lyndon words with respect to the Chomsky hierarchy appears still to be open. It has been shown by \textit{H. Petersen} [Theor.
Berstel, Jean, Boasson, Luc
openaire   +3 more sources

Lyndon words.

Arch. Formal Proofs, 2021
Stepan Holub, Stepán Starosta
openaire   +1 more source

Generalized Lyndon factorizations of infinite words

Theoretical Computer Science, 2020
Amanda Burcroff
exaly  

V-Words, Lyndon Words and Substring circ-UMFFs

2023
Jacqueline W. Daykin, Neerja Mhaskar, W. F. Smyth   +2 more
openaire   +2 more sources

A public key cryptosystem based on Lyndon words

Information Processing Letters, 1990
Lisa Mathew
exaly  

More restrictive Gray codes for necklaces and Lyndon words

Information Processing Letters, 2008
Vincent Vajnovszki
exaly  

The standard factorization of Lyndon words: an average point of view

Discrete Mathematics, 2005
Frédérique Bassino, Julien Clement
exaly  

Ranking and unranking fixed-density necklaces and Lyndon words

Theoretical Computer Science, 2019
Joe Sawada
exaly  

Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences

Journal of Discrete Algorithms, 2017
Joe Sawada
exaly