More properties of the Fibonacci word on an infinite alphabet

10/08/2017
by   Amy Glen, et al.
0

Recently the Fibonacci word W on an infinite alphabet was introduced by [Zhang et al., Electronic J. Combinatorics 24-2 (2017) #P2.52] as a fixed point of the morphism ϕ: (2i) (2i)(2i+ 1), (2i+ 1) (2i+ 2) over all i ∈N. In this paper we investigate the occurrence of squares, palindromes, and Lyndon factors in this infinite word.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/03/2022

Properties of a Ternary Infinite Word

We study the properties of the ternary infinite word p = 012102101021012...
research
05/18/2020

Reconstructing Maps from Text

Previous research has demonstrated that Distributional Semantic Models (...
research
10/16/2022

A Note On ℓ-Rauzy Graphs for the Infinite Fibonacci Word

The ℓ-Rauzy graph of order k for any infinite word is a directed graph i...
research
04/25/2019

Palindromes in two-dimensional Words

A two-dimensional (2D) word is a 2D palindrome if it is equal to its rev...
research
07/08/2021

GenSys: A Scalable Fixed-point Engine for Maximal Controller Synthesis over Infinite State Spaces

The synthesis of maximally-permissive controllers in infinite-state syst...
research
11/25/2020

Left Lyndon tree construction

We extend the left-to-right Lyndon factorisation of a word to the left L...
research
07/28/2020

On Accuracy and Coherence with Infinite Opinion Sets

There is a well-known equivalence between avoiding accuracy dominance an...

Please sign up or login with your details

Forgot password? Click here to reset