Automatic Kolmogorov complexity and normality revisited

DOI10.1007/978-3-662-55751-8_33MaRDI QIDQ1679997zbMATH OpenOpenAlexFDO

Authors A. Shen

Publication date 22 November 2017

Full work available at URL https://doi.org/10.1007/978-3-662-55751-8_33

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Normal numbers, radix expansions, Pisot numbers, Salem numbers, good lattice points, etc. (11K16) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• Automatic Kolmogorov complexity, normality, and finite-state dimension revisited
• scientific article; zbMATH DE number 177152
• Normal numbers and finite automata
• Finite State Incompressible Infinite Sequences
• Finite state incompressible infinite sequences

Cited in

(6)

• Automatic Kolmogorov complexity, normality, and finite-state dimension revisited
• Reconciling Data Compression and Kolmogorov Complexity
• Normal numbers and finite automata
• Automatic complexity. A computable measure of irregularity
• A New Approach to Formal Language Theory by Kolmogorov Complexity
• scientific article; zbMATH DE number 177152 (Why is no real title available?)

This page was built for publication: Automatic Kolmogorov complexity and normality revisited

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1679997)