ON DETERMINISTIC FINITE STATE MACHINES IN RANDOM ENVIRONMENTS

DOI10.1017/S0269964818000451zbMath1502.68166OpenAlexW2902295796MaRDI QIDQ5056630

Joel Ratsaby

Publication date: 8 December 2022

Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0269964818000451

zbMATH Keywords

Markov chainfrequency instabilityprediction of random binary sequencessubsequence selection

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An empirical study of the complexity and randomness of prediction error sequences
• On tables of random numbers
• Stochastic processes in cell biology
• Kolmogorov-Loveland Stochasticity and Kolmogorov Complexity
• The Effects of a Rapidly-Fluctuating Random Environment on Systems of Interacting Species
• On maintained systems operating in a random environment
• Reliability analysis for systems in a random environment
• The sample complexity of pattern classification with neural networks: the size of the weights is more important than the size of the network
• Universal prediction
• A heterogeneous blocking system in a random environment
• Understanding Markov Chains
• Uniform Chernoff and Dvoretzky-Kiefer-Wolfowitz-type inequalities for Markov chains and related processes
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations

This page was built for publication: ON DETERMINISTIC FINITE STATE MACHINES IN RANDOM ENVIRONMENTS