Finite-state independence and normal sequences (Q2424666)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Finite-state independence and normal sequences
scientific article

    Statements

    Finite-state independence and normal sequences (English)
    0 references
    0 references
    0 references
    0 references
    25 June 2019
    0 references
    Finite-state independence of normal sequences is characterized in three different ways using three different types of asynchronous deterministic finite automata with two input tapes. An algorithm to construct a pair of finite-state independent normal sequences is also given.
    0 references
    0 references
    normal sequence
    0 references
    finite-state independence
    0 references
    Agafonov's theorem
    0 references
    normal numbers
    0 references
    finite automata with two input tapes
    0 references
    0 references
    0 references