This collaborative volume presents recent trends arising from the fruitful interaction between
the themes of combinatorics on words, automata and formal language theory, and number …

Le but de ce survol est d'aborder définitions et propriétés concernant la numération d'un
point de vue dynamique: nous nous concentrons sur les systèmes de numération, leur …

We give some generalizations of k-automatic sequences replacing the k-ary system by an
abstract numeration system on a regular language. We study some of the closure properties …

The interplay between words, computability, algebra and arithmetic has now proved its
relevance and fruitfulness. Indeed, the cross-fertilization between formal logic and finite …

We consider extensions and restrictions of Wythoff's game having exactly the same set of P
positions as the original game. No strict subset of rules gives the same set of P positions. On …

Firstly studied by Kempa and Prezza in 2018 as the cement of text compression algorithms,
string attractors have become a compelling object of theoretical research within the …

This paper is about counting the number of distinct (scattered) subwords occurring in a given
word. More precisely, we consider the generalization of the Pascal triangle to binomial …

Let L be an infinite regular language on a totally ordered alphabet (Σ,<). Feeding a finite
deterministic automaton (with output) with the words of L, enumerated lexicographically with …

An infinite word is S-automatic if, for all n≥ 0, its (n+ 1) th letter is the output of a
deterministic automaton fed with the representation of n in the numeration system S. In this …

Motivated by the study of Fibonacci-like Wang shifts, we define a numeration system for ZZ
and Z^ 2 Z 2 based on the binary alphabet {0, 1\} 0, 1. We introduce a set of 16 Wang tiles …