info:eu-repo/semantics/article
Finite-state independence and normal sequences
Fecha
2019-08Registro en:
Alvarez, Nicolás Alejandro; Becher, Veronica Andrea; Carton, Olivier; Finite-state independence and normal sequences; Academic Press Inc Elsevier Science; Journal of Computer and System Sciences; 103; 8-2019; 1-17
0022-0000
CONICET Digital
CONICET
Autor
Alvarez, Nicolás Alejandro
Becher, Veronica Andrea
Carton, Olivier
Resumen
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.