Finite-state independence and normal sequences

DOI10.1016/j.jcss.2019.02.001zbMath1423.68239arXiv1702.00320OpenAlexW2583456329MaRDI QIDQ2424666

Verónica Becher, Olivier Carton, Nicolás Alvarez

Publication date: 25 June 2019

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1702.00320

zbMATH Keywords

normal numbersnormal sequenceAgafonov's theoremfinite automata with two input tapesfinite-state independence

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Normal numbers, radix expansions, Pisot numbers, Salem numbers, good lattice points, etc. (11K16)

Related Items (1)

Automatic Kolmogorov complexity, normality, and finite-state dimension revisited

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A polynomial-time algorithm for computing absolutely normal numbers
• Normality and automata
• Turing's unpublished algorithm for normal numbers
• Finite-state independence
• Finite-state dimension
• Normality and two-way automata
• Non-negative matrices and Markov chains.
• Endliche Automaten und Zufallsfolgen
• Normal Numbers and Computer Science
• The Construction of Decimals Normal in the Scale of Ten

This page was built for publication: Finite-state independence and normal sequences