We implement a decision procedure for answering questions about a class of infinite words
that might be called (for lack of a better name)“Fibonacci-automatic”. This class includes, for …

We implement a decision procedure for answering questions about a class of infinite words
that might be called (for lack of a better name)" Fibonacci-automatic". This class includes, for …

Let ω be a factor of the Fibonacci sequence F∞= x 1 x 2⋯, then it occurs in the sequence
infinitely many times. Let ω p be the p-th occurrence of ω and rp (ω) be the p-th return word …

Abstract Assume that X={x 1,…, xg} is a finite alphabet and K is a field. We study monomial
algebras A= K< X>/(W), where W is an antichain of Lyndon words in X of arbitrary cardinality …

Several properties of finite Sturmian words are proved. The inverse of the Richomme–
Séébold bijection between factor sets of given length of Sturmian sequences and left special …

The infinite Fibonacci sequence $\mathbf {F} $, which is an extension of the classic
Fibonacci sequence to the infinite alphabet $\mathbb {N} $, is the fixed point of the …

A finite word u is said to be bordered if u has a proper prefix which is also a suffix of u, and
unbordered otherwise. Ehrenfeucht and Silberger proved that an infinite word is purely …

We study the abelian period sets of Sturmian words, which are codings of irrational rotations
on a one-dimensional torus. The main result states that the minimum abelian period of a …

In this paper, we determine the maximum number of distinct Lyndon factors that a word of
length $ n $ can contain. We also derive formulas for the expected total number of Lyndon …

Recently the Fibonacci word W on an infinite alphabet was introduced by Zhang et
al.(2017)[13] as a fixed point of the morphism ϕ:(2 i)↦(2 i)(2 i+ 1),(2 i+ 1)↦(2 i+ 2) over all i∈ …