2 citations · 3 across the 3 of their papers we have counts for
Showing cs.DMShow all
3 papers · 1 filter
cs.DM2007
On Almost Periodicity Criteria for Morphic Sequences in Some Particular Cases
Yuri Pritykin
In some particular cases we give criteria for morphic sequences to be almost periodic (=uniformly recurrent). Namely, we deal with fixed points of non-erasing morphisms and with au…
cs.DM2006★ 1 cited
Almost Periodicity, Finite Automata Mappings and Related Effectiveness Issues
Yuri Pritykin
The paper studies different variants of almost periodicity notion. We introduce the class of eventually strongly almost periodic sequences where some suffix is strongly almost peri…
cs.DM2006★ 2 cited
Strongly Almost Periodic Sequences under Finite Automata Mappings
Yuri Pritykin
The notion of almost periodicity nontrivially generalizes the notion of periodicity. Strongly almost periodic sequences (=uniformly recurrent infinite words) first appeared in the…