Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1016/j.jcss.2019.02.001 | Journal of Computer and System Sciences |
Keywords | Field | DocType |
Finite-state automata,Finite transducers,Normal sequences,Agafonov's theorem,Normal numbers | Discrete mathematics,Asynchronous communication,Systems science,Deterministic finite automaton,Finite state,Finite-state machine,Normal number,Number theory,Mathematics | Journal |
Volume | ISSN | Citations |
103 | 0022-0000 | 0 |
PageRank | References | Authors |
0.34 | 4 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nicolás Alvarez | 1 | 0 | 0.68 |
| Verónica Becher | 2 | 121 | 22.89 |
| Olivier Carton | 3 | 381 | 40.97 |