Selection functions that do not preserve normality

Theory of Computing Systems

Volumn 39, Issue 5, 2006, Pages 685-697

  Merkle, Wolfgang ^a   Reimann, Jan ^a  

^a UNIVERSITY OF HEIDELBERG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

LINEAR LANGUAGE; SELECTION FUNCTION;

MATHEMATICAL TECHNIQUES;

COMPUTER SCIENCE;

EID: 33748523152     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-005-1253-z     Document Type: Article

References (20)

1. V. N. Agafonoff. Normal sequences and finite automata. Soviet Mathematics Doklady, 9:324-325, 1968.
2. K. Ambos-Spies and A. Kučera. Randomness in computability theory. In P. Cholak et al. (eds.), Computability Theory: Current Trends and Open Problems, pp. 1-14. Contemporary Mathematics 257. American Mathematical Society, Providence, RI, 2000.
3. K. Ambos-Spies and E. Mayordomo. Resource-bounded balanced genericity, stochasticity and weak randomness. In A. Sorbi (ed.), Complexity, Logic, and Recursion Theory, pp. 1-47. Marcel Dekker, New York, 1997.
4. J.-M. Autebert, J. Berstel, and L. Boasson. Context-free languages and pushdown automata. In G. Rozenberg and A. Salomaa (eds.), Handbook of Formal Languages. Springer, New York, 1997.
5. J.L. Balcázar, J. Díaz, and J. Gabarró. Structural Complexity, Vols. I and II. Springer, New York, 1995 and 1990.
6. A. Broglio and P. Liardet. Predictions with automata. In Symbolic Dynamics and Its Applications, Proceedings of the AMS Confeience in Honor of R.L. Adler, New Haven, CT(USA) 1991,pp. 111-124. Contemporary Mathematics 135. American Mathematical Society, Providence, RI, 1992.
7. D. G. Champernowne. The construction of decimals normal in the scale often. Journal of the London Mathematical Society 8:254-260, 1933.
8. A. Church. On the concept of a random number. Bulletin of the AMS, 46:130-135, 1940.
9. T. Kamae. Subsequences of normal sequences. Israel Journal of Mathematics, 16:121-149, 1973.
10. T. Kamae and B. Weiss. Normal numbers and selection rules. Israel Journal of Mathematics, 21(2-3):101-110, 1975.
11. M. van Lambalgen. Random Sequences. Doctoral dissertation, Universiteit van Amsterdam, Amsterdam, 1987.
12. M. Li and P. Vitányi. An Introduction to Kolmogorov Complexity and Its Applications, second edition. Springer, New York, 1997.
13. J. H. Lutz. The quantitative structure of exponential time. In L. A. Hemaspaandra, and A. L. Selman (eds.), Complexity Theory Retrospective II, pp. 225-260. Springer-Verlag, New York, 1997.
14. R. von Mises. Probability, Statistics and Truth. Macmillan, New York, 1957.
15. M. G. O'Connor. An unpredictability approach to finite-state randomness. Journal of Computer and System Sciences, 37(3):324-336, 1988.
16. P. Odifreddi. Classical Recursion Theory, Vol. 1. North-Holland, Amsterdam, 1989.
17. L. P. Postnikova. On the connection between the concepts of collectives of Mises-Church and normal Bernoulli sequences of symbols. Theory of Probability and its Applications 6:211-213, 1961.
18. C. P. Schnorr and H. Stimm. Endliche Automaten und Zufallsfolgen (Finite automata and random sequences). Acta Informatica 1:345-359, 1972.
19. V. A. Uspensky, A. L. Semenov, and A. Kh. Shen'. Can an individual sequence of zeros and ones be random? Russian Mathematical Surveys, 45:121-189, 1990.
20. B. Weiss. Single Orbit Dynamics. American Mathematical Society, Providence, RI, 2000.