Endliche Automaten und Zufallsfolgen

DOI10.1007/BF00289514zbMath0238.68017OpenAlexW2013665528WikidataQ56158175 ScholiaQ56158175MaRDI QIDQ2553152

H. Stimm, Claus Peter Schnorr

Publication date: 1972

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00289514

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (28)

Normality and finite-state dimension of Liouville numbers ⋮ A normal sequence compressed by PPM* but not by Lempel-Ziv 78 ⋮ Finite-state dimension ⋮ Dimensions of Copeland-Erdös sequences ⋮ Automatic Kolmogorov complexity, normality, and finite-state dimension revisited ⋮ Functions that preserve p-randomness ⋮ A divergence formula for randomness and dimension ⋮ Pushdown and Lempel-Ziv depth ⋮ Finite-state relative dimension, dimensions of AP subsequences and a finite-state van Lambalgen's theorem ⋮ Finite-state independence and normal sequences ⋮ Fractal dimension and logarithmic loss unpredictability. ⋮ Normal Numbers and Computer Science ⋮ Base invariance of feasible dimension ⋮ Finite-state dimension and real arithmetic ⋮ Normality and automata ⋮ Finite state complexity ⋮ Finite-state independence ⋮ Pushdown dimension ⋮ Preservation of normality by non-oblivious group selection ⋮ Computing absolutely normal numbers in nearly linear time ⋮ Preservation of normality by transducers ⋮ On normality in shifts of finite type ⋮ Normality and two-way automata ⋮ Computable analysis and classification problems ⋮ Algorithmic Fractal Dimensions in Geometric Measure Theory ⋮ Normality in non-integer bases and polynomial time randomness ⋮ Finite state incompressible infinite sequences ⋮ Entropy rates and finite-state dimension

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory)
• On the Length of Programs for Computing Finite Binary Sequences
• A variant of the Kolmogorov concept of complexity
• The definition of random sequences

This page was built for publication: Endliche Automaten und Zufallsfolgen