Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Lyndon Words and Christoffel Words
View through CrossRef
This chapter covers the lexicographical ordering of lower Christoffel words, which is equivalent to the ordering by their slopes (Borel and Laubie). Lower Christoffel words are particular Lyndon words. They are maximum for the lexicographical order among Lyndon words of a given slope (Borel and Laubie). They are, together with the upper Christoffel words, the only unbordered finite Sturmian words (Chuan). They are exactly the Lyndon words which are Sturmian words (Berstel and de Luca). The standard factorization of a lower Christoffel word is obtained by cutting before the smallest lexicographical suffix. Finally, they are exactly the Lyndon words which are equilibrated (Melançon).
Title: Lyndon Words and Christoffel Words
Description:
This chapter covers the lexicographical ordering of lower Christoffel words, which is equivalent to the ordering by their slopes (Borel and Laubie).
Lower Christoffel words are particular Lyndon words.
They are maximum for the lexicographical order among Lyndon words of a given slope (Borel and Laubie).
They are, together with the upper Christoffel words, the only unbordered finite Sturmian words (Chuan).
They are exactly the Lyndon words which are Sturmian words (Berstel and de Luca).
The standard factorization of a lower Christoffel word is obtained by cutting before the smallest lexicographical suffix.
Finally, they are exactly the Lyndon words which are equilibrated (Melançon).
Related Results
Balance properties on Christoffel words and applications
Balance properties on Christoffel words and applications
Propriétés d'équilibre sur les mots de Christoffel et applications.
De nombreux chercheurs se sont intéressés à la Combinatoire des mots aussi bien d'un point de vu...
From Christoffel Words to Markoff Numbers
From Christoffel Words to Markoff Numbers
Christoffel introduced in 1875 a special class of words on a binary alphabet, linked to continued fractions. Some years laterMarkoff published his famous theory, called nowMarkoff ...
Enhancing Graph-based Machine Learning through Lyndon Partial Words
Enhancing Graph-based Machine Learning through Lyndon Partial Words
Objectives: This study integrates the combinatorial properties of Lyndon partial words with Graph-Based Machine Learning (GBML) to develop an innovative approach for sequence analy...
Words and Quadratic Numbers
Words and Quadratic Numbers
This chapter offers an overview of words and quadratic numbers, and in particular ordering the conjugates of a Christoffel word. Within this topic the reader learns that the revers...
Numerology
Numerology
This chapter gives several examples, which may help the reader to work in concrete terms with Markoff numbers, Christoffel words, Markoff constants, and quadratic forms. In particu...
Računalno potpomognuto usmjeravanje kod dvojezičnih govornika
Računalno potpomognuto usmjeravanje kod dvojezičnih govornika
This thesis investigates whether modern computer models can confirm how people encounter words and then use these findings in didactics. In recent years, computers have been used i...
Computing Longest Lyndon Subsequences and Longest Common Lyndon Subsequences
Computing Longest Lyndon Subsequences and Longest Common Lyndon Subsequences
AbstractGiven a string T of length n whose characters are drawn from an ordered alphabet of size $$\sigma $$
σ
, its longest Lyndon subsequence is...
Computing Longest Lyndon Subsequences and Longest Common Lyndon Subsequences
Computing Longest Lyndon Subsequences and Longest Common Lyndon Subsequences
Abstract
Given a string T with length n whose characters are drawn from an ordered alphabet of size σ, its longest Lyndon subsequence is a longest subsequence of T that is ...