We consider the sequence of integers whose nth term has base-p expansion...
Two words are k-binomially equivalent, if each word of length at most k
...
Regular sequences generalize the extensively studied automatic sequences...
The nth term of an automatic sequence is the output of a deterministic
f...
Two finite words u and v are k-binomially equivalent if, for each word
x...
A reconstruction problem of words from scattered factors asks for the mi...
This work contributes to the study of rewrite games where positions are ...
Two words are k-binomially equivalent whenever they share the same
subwo...