Publisher
Springer Science and Business Media LLC
Subject
Computer Networks and Communications,Information Systems,Software
Reference13 articles.
1. Agafonoff, V. N.: Normal sequences and finite automata. Soviet Math. Dokl. 9, 324?325 (1968) (engl. Übersetzung).
2. Böhling, K. H., Indermark, K.: Endliche Automaten I. Mannheim: BI 1969.
3. Chaitin, G. J.: On the length of programs for computing finite binary sequences. Journ. ACM 13, 547?569 (1966).
4. Chung, K. L.: Markov chains with stationary transition probabilities, 2. edition. Berlin-Göttingen-Heidelberg: Springer 1967.
5. Copeland, A. H.: Admissible numbers in the theory of probability. Amer. Journ. Math. 50, 535?552 (1928).
Cited by
48 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Pebble-depth;Theoretical Computer Science;2024-09
2. Deterministic pushdown automata can compress some normal sequences;Logical Methods in Computer Science;2024-08-12
3. Finite-state relative dimension, dimensions of A. P. subsequences and a finite-state van Lambalgen's theorem;Information and Computation;2024-06
4. Pushdown and Lempel-Ziv depth;Information and Computation;2023-06
5. Finite-State Mutual Dimension;2022 58th Annual Allerton Conference on Communication, Control, and Computing (Allerton);2022-09-27