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
Autores principales: Álvarez, N., Becher, V., Carton, O.
Formato: JOUR
Materias:
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_00220000_v103_n_p1_Alvarez
Aporte de:
id todo:paper_00220000_v103_n_p1_Alvarez
record_format dspace
spelling todo:paper_00220000_v103_n_p1_Alvarez2023-10-03T14:25:21Z Finite-state independence and normal sequences Álvarez, N. Becher, V. Carton, O. 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. JOUR info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by/2.5/ar 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
Álvarez, N.
Becher, V.
Carton, O.
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.
format JOUR
author Álvarez, N.
Becher, V.
Carton, O.
author_facet Álvarez, N.
Becher, V.
Carton, O.
author_sort Álvarez, N.
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
url http://hdl.handle.net/20.500.12110/paper_00220000_v103_n_p1_Alvarez
work_keys_str_mv AT alvarezn finitestateindependenceandnormalsequences
AT becherv finitestateindependenceandnormalsequences
AT cartono finitestateindependenceandnormalsequences
_version_ 1807320444676603904