An unpredictability approach to finite-state randomness
From MaRDI portal
Publication:1117699
DOI10.1016/0022-0000(88)90011-6zbMath0667.68064OpenAlexW2041202072MaRDI QIDQ1117699
Publication date: 1988
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-0000(88)90011-6
Formal languages and automata (68Q45) Normal numbers, radix expansions, Pisot numbers, Salem numbers, good lattice points, etc. (11K16)
Related Items (3)
Prediction of infinite words with automata ⋮ McCulloch-Pitts Brains and Pseudorandom Functions ⋮ Normality and automata
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximation of functions on the integers
- On the definition of normal numbers
- On a paper of Niven and Zuckerman
- Normal \(k\)-tuples
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
- A finite-memory deterministic algorithm for the symmetric hypothesis testing problem
- Finite-memory classification of Bernoulli sequences using reference samples (Corresp.)
- On testing simple hypotheses in finite time with Hellman-Cover automata
- Finite memory algorithms for testing bernoulli random variables
- Testing a simple symmetric hypothesis by a finite-memory deterministic algorithm
- Complete degrees of finite-state transformability
- Combinatorial Structure of the Faces of then-Cube
- Degrees of finite-state transformability
- An Example of Information and Computation Resource Trade-Off
- On the Length of Programs for Computing Finite Binary Sequences
- A variant of the Kolmogorov concept of complexity
- The two-armed-bandit problem with time-invariant finite memory
- A unified approach to the definition of random sequences
- The definition of random sequences
- Note on normal numbers
This page was built for publication: An unpredictability approach to finite-state randomness
