Automatic Kolmogorov Complexity and Normality Revisited

@inproceedings{Shen2017AutomaticKC,
  title={Automatic Kolmogorov Complexity and Normality Revisited},
  author={A. Shen},
  booktitle={FCT},
  year={2017}
}
  • A. Shen
  • Published in FCT 2017
  • Computer Science, Mathematics
It is well known that normality (all factors of a given length appear in an infinite sequence with the same frequency) can be described as incompressibility via finite automata. Still the statement and the proof of this result as given by Becher and Heiber (2013) in terms of “lossless finite-state compressors” do not follow the standard scheme of Kolmogorov complexity definition (an automaton is used for compression, not decompression). We modify this approach to make it more similar to the… Expand
Automatic Kolmogorov complexity, normality, and finite-state dimension revisited
Automatic Randomness Tests
Two Characterizations of Finite-State Dimension
Agafonov's Theorem for finite and infinite alphabets and probability distributions different from equidistribution
Superposition as Memory: Unlocking Quantum Automatic Complexity
Finite Automata and Randomness
Asymptotic Divergences and Strong Dichotomy
Automatic supermartingales acting on sequences

References

SHOWING 1-10 OF 41 REFERENCES
Finite state complexity
Relations between varieties of kolmogorov complexities
Normal numbers and finite automata
Around Kolmogorov complexity: basic notions and results
  • A. Shen
  • Computer Science, Mathematics
  • ArXiv
  • 2015
Finite-State Independence
Algorithmic Randomness and Complexity
Turing's Normal Numbers: Towards Randomness
  • V. Becher
  • Mathematics, Computer Science
  • CiE
  • 2012
Endliche Automaten und Zufallsfolgen
An Introduction to Kolmogorov Complexity and Its Applications
  • Ming Li, P. Vitányi
  • Computer Science, Psychology
  • Texts and Monographs in Computer Science
  • 1993
...
1
2
3
4
5
...