Finite-state independence
From MaRDI portal
Publication:1787949
DOI10.1007/s00224-017-9821-6zbMath1404.68066arXiv1611.03921OpenAlexW2561978260WikidataQ61927000 ScholiaQ61927000MaRDI QIDQ1787949
Verónica Becher, Pablo Ariel Heiber, Olivier Carton
Publication date: 5 October 2018
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1611.03921
Formal languages and automata (68Q45) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)
Related Items (6)
Automatic Kolmogorov complexity, normality, and finite-state dimension revisited ⋮ On simply normal numbers with digit dependencies ⋮ Finite-state relative dimension, dimensions of AP subsequences and a finite-state van Lambalgen's theorem ⋮ Finite-state independence and normal sequences ⋮ Normal Numbers and Computer Science ⋮ Normal numbers with digit dependencies
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Normality and automata
- Algorithmically independent sequences
- Conditional probabilities and van Lambalgen's theorem revisited
- Finite-state dimension
- Normal numbers and finite automata
- Normality and two-way automata
- Endliche Automaten und Zufallsfolgen
- Nondeterministic Automatic Complexity of Almost Square-Free and Strongly Cube-Free Words
- Algorithmic Randomness and Complexity
- Von Mises' definition of random sequences reconsidered
- Kolmogorov Complexity and Algorithmic Randomness
- Normal Numbers and Computer Science
- A Method for the Construction of Minimum-Redundancy Codes
- An introduction to Kolmogorov complexity and its applications
This page was built for publication: Finite-state independence
