Endliche Automaten und Zufallsfolgen
- Cite this article as:
- Schnorr, C.P. & Stimm, H. Acta Informatica (1972) 1: 345. doi:10.1007/BF00289514
- 68 Downloads
We consider the behaviour of finite automata on infinite binary sequences and study the class of random tests which can be carried out by finite automata. We give several equivalent characterizations of those infinite binary sequences which are random relative to finite automata. These characterizations are based on the concepts of selection rules, martingales and invariance properties defined by finite automata.