Normal numbers and finite automata

DOI10.1016/j.tcs.2013.01.019zbMath1261.68079OpenAlexW2129389224WikidataQ61927019 ScholiaQ61927019MaRDI QIDQ1945947

Pablo Ariel Heiber, Verónica Becher

Publication date: 17 April 2013

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2013.01.019

zbMATH Keywords

expansionfinite automataincompressiblereal numberAgafonov's theoreminjective finite-state transducerslossless finite-state compressorsnormal real number

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Special sequences and polynomials (11B83)

Related Items (11)

Continued fraction normality is not preserved along arithmetic progressions ⋮ A normal sequence compressed by PPM* but not by Lempel-Ziv 78 ⋮ Automatic Kolmogorov complexity, normality, and finite-state dimension revisited ⋮ Pushdown and Lempel-Ziv depth ⋮ Normal Numbers and Computer Science ⋮ Normality and automata ⋮ Finite-state independence ⋮ Preservation of normality by non-oblivious group selection ⋮ Preservation of normality by transducers ⋮ On normality in shifts of finite type ⋮ Normality and two-way automata

This page was built for publication: Normal numbers and finite automata