We extend classical Ostrowski numeration systems, closely related to Sturmian words, by
allowing a wider range of coefficients, so that possible representations of a number n better …

A unifying description of lattice potentials generated by aperiodic one-dimensional
sequences is proposed in terms of their local reflection or parity symmetry properties. We …

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 …

We study the problem of finding all maximal approximate gapped palindromes in a string.
More specifically, given a string S of length n, a parameter q≥ 0 and a threshold k> 0, the …

A palindrome is a symmetric string, phrase, number, or other sequence of units sequence
that reads the same forward and backward. We present an algorithm for maximal …

This paper concerns a specific class of strict standard episturmian words whose directive
words resemble those of characteristic Sturmian words. In particular, we explicitly determine …

Combinatorics on words plays a fundamental role in various fields of mathematics, not to
mention its relevance in theoretical computer science and physics. Most renowned among …

A palindrome is a symmetric string that reads the same forward and backward. Let pals (w)
denote the set of maximal palindromes of a string w in which each palindrome is …

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 …

Let α be an irrational number with 0< α< 1, and let fα be the characteristic word of α. The
location of a factor w of fα is defined to be the set of all positions in fα at which w occurs. In …