Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

On morphisms preserving infinite Lyndon words

View through CrossRef
In a previous paper, we characterized free monoid morphisms preserving finite Lyndon words. In particular, we proved that such a morphism preserves the order on finite words. Here we study morphisms preserving infinite Lyndon words and morphisms preserving the order on infinite words. We characterize them and show relations with morphisms preserving Lyndon words or the order on finite words. We also briefly study morphisms preserving border-free words and those preserving the radix order.
Centre pour la Communication Scientifique Directe (CCSD)
Title: On morphisms preserving infinite Lyndon words
Description:
In a previous paper, we characterized free monoid morphisms preserving finite Lyndon words.
In particular, we proved that such a morphism preserves the order on finite words.
Here we study morphisms preserving infinite Lyndon words and morphisms preserving the order on infinite words.
We characterize them and show relations with morphisms preserving Lyndon words or the order on finite words.
We also briefly study morphisms preserving border-free words and those preserving the radix order.

Related Results

Lyndon Words and Christoffel Words
Lyndon Words and Christoffel Words
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 par...
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...
Characterization of Infinite LSP Words and Endomorphisms Preserving the LSP Property
Characterization of Infinite LSP Words and Endomorphisms Preserving the LSP Property
Answering a question of G. Fici, we give an [Formula: see text]-adic characterization of the family of infinite LSP words, that is, the family of infinite words having all their le...
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...
Lyndon words and Christoffel words
Lyndon words and Christoffel words
Abstract We give the basic properties of Lyndon words. Lower Christoffel words are particular Lyndon words. They are maximal for the lexicographical order among Ly...
Occurrence of dystonic-type response to physical stress in soccer players
Occurrence of dystonic-type response to physical stress in soccer players
Purpose: to investigate the occurrence of dystonic type response to physical activity in the form of submaximal PWC170 test in soccer players. Material & Methods: 741 soccer pl...
Practical Evaluation of Lyndon Factors via Alphabet Reordering
Practical Evaluation of Lyndon Factors via Alphabet Reordering
We evaluate the influence of different alphabet orderings on the Lyndon factorization of a string. Experiments with Pizza&Chili datasets show that for most alphabet reorderings...
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...

Back to Top