Finite-state independence and normal sequences
We consider the previously defined notion of finite-state independence and we focus specifically on normal words. We characterize finite-state independence of normal words in three different ways, using three different kinds of asynchronous deterministic finite automata with two input tapes containi...
Guardado en:
| Publicado: |
2019
|
|---|---|
| Materias: | |
| Acceso en línea: | https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_00220000_v103_n_p1_Alvarez http://hdl.handle.net/20.500.12110/paper_00220000_v103_n_p1_Alvarez |
| Aporte de: |
| id |
paper:paper_00220000_v103_n_p1_Alvarez |
|---|---|
| record_format |
dspace |
| spelling |
paper:paper_00220000_v103_n_p1_Alvarez2023-06-08T14:45:02Z Finite-state independence and normal sequences Agafonov's theorem Finite transducers Finite-state automata Normal numbers Normal sequences Computer networks Finite automata Systems science Agafonov's theorem Deterministic finite automata Finite state Finite transducers Infinite word Normal numbers Normal sequences Number theory We consider the previously defined notion of finite-state independence and we focus specifically on normal words. We characterize finite-state independence of normal words in three different ways, using three different kinds of asynchronous deterministic finite automata with two input tapes containing infinite words. Based on one of the characterizations we give an algorithm to construct a pair of finite-state independent normal words. © 2019 Elsevier Inc. 2019 https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_00220000_v103_n_p1_Alvarez http://hdl.handle.net/20.500.12110/paper_00220000_v103_n_p1_Alvarez |
| institution |
Universidad de Buenos Aires |
| institution_str |
I-28 |
| repository_str |
R-134 |
| collection |
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) |
| topic |
Agafonov's theorem Finite transducers Finite-state automata Normal numbers Normal sequences Computer networks Finite automata Systems science Agafonov's theorem Deterministic finite automata Finite state Finite transducers Infinite word Normal numbers Normal sequences Number theory |
| spellingShingle |
Agafonov's theorem Finite transducers Finite-state automata Normal numbers Normal sequences Computer networks Finite automata Systems science Agafonov's theorem Deterministic finite automata Finite state Finite transducers Infinite word Normal numbers Normal sequences Number theory Finite-state independence and normal sequences |
| topic_facet |
Agafonov's theorem Finite transducers Finite-state automata Normal numbers Normal sequences Computer networks Finite automata Systems science Agafonov's theorem Deterministic finite automata Finite state Finite transducers Infinite word Normal numbers Normal sequences Number theory |
| description |
We consider the previously defined notion of finite-state independence and we focus specifically on normal words. We characterize finite-state independence of normal words in three different ways, using three different kinds of asynchronous deterministic finite automata with two input tapes containing infinite words. Based on one of the characterizations we give an algorithm to construct a pair of finite-state independent normal words. © 2019 Elsevier Inc. |
| title |
Finite-state independence and normal sequences |
| title_short |
Finite-state independence and normal sequences |
| title_full |
Finite-state independence and normal sequences |
| title_fullStr |
Finite-state independence and normal sequences |
| title_full_unstemmed |
Finite-state independence and normal sequences |
| title_sort |
finite-state independence and normal sequences |
| publishDate |
2019 |
| url |
https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_00220000_v103_n_p1_Alvarez http://hdl.handle.net/20.500.12110/paper_00220000_v103_n_p1_Alvarez |
| _version_ |
1768545034518396928 |