Finite-state independence and normal sequences

BECHER, VERÓNICA; BECHER, VERÓNICA; ÁLVAREZ, NICOLÁS; ÁLVAREZ, NICOLÁS; CARTON, OLIVIER; CARTON, OLIVIER

JOURNAL OF COMPUTER AND SYSTEM SCIENCES

ACADEMIC PRESS INC ELSEVIER SCIENCE

Año: 2019 vol. 103 p. 1 - 17

0022-0000

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.