Artículo

Finite-state independence and normal sequences

Alvarez, Nicolás AlejandroIcon ; Becher, Veronica AndreaIcon ; Carton, Olivier
Fecha de publicación: 08/2019
Editorial: Academic Press Inc Elsevier Science
Revista: Journal of Computer and System Sciences
ISSN: 0022-0000
Idioma: Inglés
Tipo de recurso: Artículo publicado
Clasificación temática:

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.
Palabras clave: AGAFONOV'S THEOREM , FINITE TRANSDUCERS , FINITE-STATE AUTOMATA , NORMAL NUMBERS , NORMAL SEQUENCES
 
Archivos asociados
Tamaño: 308.7Kb
Formato: PDF
.
Licencia
info:eu-repo/semantics/restrictedAccess Excepto donde se diga explícitamente, este item se publica bajo la siguiente descripción: Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Unported (CC BY-NC-SA 2.5)
Identificadores
URI: http://hdl.handle.net/11336/123311
URL: https://doi.org/10.1016/j.jcss.2019.02.001
DOI: http://dx.doi.org/10.1016/j.jcss.2019.02.001
Colecciones
Articulos(ICC)
Articulos de INSTITUTO DE INVESTIGACION EN CIENCIAS DE LA COMPUTACION
Citación
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
Compartir
Altmétricas