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...

Descripción completa

Guardado en:
Detalles Bibliográficos
Publicado: 2019
Materias:
Agafonov's theorem
Finite transducers
Finite-state automata
Normal numbers
Normal sequences
Computer networks
Finite automata
Systems science
Deterministic finite automata
Finite state
Infinite word
Number theory
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:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares