Endliche Automaten und Zufallsfolgen
From MaRDI portal
Publication:2553152
Cites work
- A variant of the Kolmogorov concept of complexity
- scientific article; zbMATH DE number 3015360 (Why is no real title available?)
- scientific article; zbMATH DE number 3236503 (Why is no real title available?)
- scientific article; zbMATH DE number 3307590 (Why is no real title available?)
- scientific article; zbMATH DE number 3335925 (Why is no real title available?)
- scientific article; zbMATH DE number 3383900 (Why is no real title available?)
- On the Length of Programs for Computing Finite Binary Sequences
- The definition of random sequences
- Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory)
Cited in
(34)- Fractal dimension and logarithmic loss unpredictability.
- Finite-state independence
- Finite-state dimension
- Preservation of normality by non-oblivious group selection
- Computing absolutely normal numbers in nearly linear time
- Preservation of normality by transducers
- Computable analysis and classification problems
- Normality and two-way automata
- Normality in non-integer bases and polynomial time randomness
- Dimensions of Copeland-Erdös sequences
- Finite-state independence and normal sequences
- Base invariance of feasible dimension
- Finite state incompressible infinite sequences
- Automatic Kolmogorov complexity, normality, and finite-state dimension revisited
- Normality and finite-state dimension of Liouville numbers
- Normal numbers and computer science
- Normality and automata
- Algorithmic Fractal Dimensions in Geometric Measure Theory
- Pushdown and Lempel-Ziv depth
- Finite-state relative dimension, dimensions of AP subsequences and a finite-state van Lambalgen's theorem
- A divergence formula for randomness and dimension
- Finite-state relative dimension, dimensions of A. P. subsequences and a finite-state van Lambalgen's theorem
- Pebble-depth
- Real numbers equally compressible in every base
- Agafonov's theorem for finite and infinite alphabets and probability distributions different from equidistribution
- Normality, relativization, and randomness
- Finite state complexity
- Agafonov's theorem for probabilistic selectors
- Algorithmic randomness in continuous-time Markov chains
- The Agafonov and Schnorr-Stimm theorems for probabilistic automata
- On normality in shifts of finite type
- Entropy rates and finite-state dimension
- A normal sequence compressed by PPM* but not by Lempel-Ziv 78
- Pushdown dimension
This page was built for publication: Endliche Automaten und Zufallsfolgen
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2553152)
