Almost Periodicity, Finite Automata Mappings and Related Effectiveness Issues
| dc.creator | Pritykin, Yuri | |
| dc.date | 2006-07-03 | |
| dc.date.accessioned | 2026-07-07T07:16:15Z | |
| dc.date.available | 2026-07-07T07:16:15Z | |
| dc.description | 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 periodic (=uniformly recurrent). The class of almost periodic sequences includes the class of eventually strongly almost periodic sequences, and we prove this inclusion to be strict. We prove that the class of eventually strongly almost periodic sequences is closed under finite automata mappings and finite transducers. Moreover, an effective form of this result is presented. Finally we consider some algorithmic questions concerning almost periodicity. | |
| dc.description | 12 pages. Continuation of the results from the paper "Strongly Almost Periodic Sequences under Finite Automata Mappings" on cs.DM/0605026 Enhanced version of the talk on Workshop on Words and Automata, St Petersburg, Russia, June 7th, 2006 (satellite to CSR'06) | |
| dc.identifier | https://arxiv.org/abs/cs/0607009 | |
| dc.identifier | http://arxiv.org/abs/cs/0607009 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/113524 | |
| dc.subject | Discrete Mathematics | |
| dc.subject | G.2.1; F.1.1 | |
| dc.title | Almost Periodicity, Finite Automata Mappings and Related Effectiveness Issues | |
| dc.type | text |