Acta Informatica

, Volume 1, Issue 4, pp 345–359

Endliche Automaten und Zufallsfolgen

  • C. P. Schnorr
  • H. Stimm
Article

DOI: 10.1007/BF00289514

Cite this article as:
Schnorr, C.P. & Stimm, H. Acta Informatica (1972) 1: 345. doi:10.1007/BF00289514

Summary

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.

Copyright information

© Springer-Verlag 1972

Authors and Affiliations

  • C. P. Schnorr
    • 1
  • H. Stimm
    • 1
  1. 1.Institut für Angewandte Mathematik der Johann Wolfgang Goethe-UniversitätFrankfurt 1Bundesrepublik Deutschland