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) …
In this paper we introduce the *well distributed occurrences* (WDO)
combinatorial property for infinite words, which guarantees good
behavior (no lattice structure) in some related pseudorandom number
generators. An infinite word $u$ on a $d$-ary …
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 study a class of infinite words on a finite alphabet
$A$ whose factors are closed under the image of an involutory
antimorphism $\theta$ of the free monoid $A^\*$.
We show that given a
recurrent infinite word $\omega \in …
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 …