Author:
Li Ming,Vitanyi Paul M. B.
Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. Barzdin', Y.M., “Complexity of programs to determine whether natural numbers not greater than n belong to a recursively enumerable set,” Soviet Math. Dokl.
9, pp. 1251–1254 (1968).
2. Chaitin, G.J., “On the length of programs for computing finite binary sequences: statistical considerations,” J. Assoc. Comp. Mach.
16, pp. 145–159 (1969).
3. Chaitin, G.J., “Information-theoretic characterizations of recursive infinite strings,” Theor. Comput. Sci.
2, pp. 45–48 (1976).
4. Ehrenfeucht, A., R. Parikh, and G. Rozenberg, “Pumping lemmas for regular sets,” SIAM J. Computing
10, pp. 536–541 (1981).
5. Floyd, R., “Review 14,” Comput. Rev.
9, p. 280 (1968).
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献