Automatic sequences are sequences over a finite alphabet generated by a finite-state
machine. This book presents a novel viewpoint on automatic sequences, and more …

As is well-known, the ratio of adjacent Fibonacci numbers tends to ϕ=(1+√ 5)/2, and the
ratio of adjacent Tribonacci numbers (where each term is the sum of the three preceding …

Combinatorics on words aims at finding deep connections between properties of
sequences. The resulting theoretical findings are often used in the design of efficient …

An acute problem when moving into the few nanometers highly advanced CMOS
technologies is represented by the inexorable cost-yield balance, lately clearly tilted by the …

A non-empty word w is a border of a word u if| w|<| u| and w is both a prefix and a suffix of u.
A word u is privileged if| u|≤ 1 or if u has a privileged border w that appears exactly twice in …

A non-empty word w is a border of the word u if| w|<| u| and w is both a prefix and a suffix of
u. A word u with the border w is closed if u has exactly two occurrences of w. A word u is …

A word~ $ w $ has a border $ u $ if $ u $ is a non-empty proper prefix and suffix of $ u $. A
word~ $ w $ is said to be\emph {closed} if $ w $ is of length at most $1 $ or if $ w $ has a …

In combinatorics on words, a word w of length n over an alphabet of size q is said to be
privileged if n<= 1 or if n>= 2 and w has a privileged border that occurs exactly twice in w …

A tiling of R^ d R d is repulsive if no r-patch can repeat arbitrarily close to itself, relative to r.
This is a characteristic property of aperiodic order, for a non-repulsive tiling has arbitrarily …

Combinatorics on words is a field of mathematics and theoretical computer science that is
concerned with sequences of symbols called words, or strings. One class of words that are …