In this paper we study how certain families of aperiodic infinite
words can be used to produce aperiodic pseudorandom number
generators (PRNGs) with good statistical behavior. We introduce
the *well distributed occurrences* (WELLDOC) …
The palindromization map $\psi$ in a free monoid $A^{\*}$ was introduced in 1997
by the first author in the case of a binary alphabet $A$, and later extended by
other authors to arbitrary alphabets. Acting on infinite words, $\psi$
generates the …
In this paper we prove the following result. Let $s$ be an infinite word on
a finite alphabet, and $N\geq 0$ be an integer. Suppose that all left
special factors of $s$ longer than $N$ are prefixes of $s$, and that $s$ has
at most one right …
In this paper we prove the following result. Let $s$ be an infinite word on
a finite alphabet, and $N\geq 0$ be an integer. Suppose that all left
special factors of $s$ longer than $N$ are prefixes of $s$, and that $s$ has
at most one right …