A characterization of binary morphisms generating Lyndon infinite words

05/04/2021
by   Gwenaël Richomme, et al.
0

An infinite word is an infinite Lyndon word if it is smaller, with respect to the lexicographic order, than all its proper suffixes, or equivalently if it has infinitely many finite Lyndon words as prefixes. A characterization of binary endomorphisms generating Lyndon infinite words is provided.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

08/08/2018

Characterization of infinite LSP words and endomorphisms preserving the LSP property

Answering a question of G. Fici, we give an S-adic characterization of t...
05/03/2019

Palindromic Ziv-Lempel and Crochemore Factorizations of m-Bonacci Infinite Words

We introduce a variation of the Ziv-Lempel and Crochemore factorizations...
03/07/2018

Quasiperiods of biinfinite Sturmian words

We study the notion of quasiperiodicity, in the sense of "coverability",...
04/01/2019

Some variations on Lyndon words

In this paper we compare two finite words u and v by the lexicographical...
12/11/2017

Infinite and Bi-infinite Words with Decidable Monadic Theories

We study word structures of the form (D,<,P) where D is either N or Z, <...
12/08/2014

Word learning under infinite uncertainty

Language learners must learn the meanings of many thousands of words, de...
02/06/2018

Programming infinite machines

For infinite machines which are free from the classical Thompson's lamp ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.