Robert P. Daley. Retraceability, Repleteness and Busy Beaver Sets. In Jozef Gruska, Michal Chytil, editors, Mathematical Foundations of Computer Science 1981, Strbske Pleso, Czechoslovakia, August 31 - September 4, 1981, Proceedings. Volume 118 of Lecture Notes in Computer Science, pages 252-261, Springer, 1981.
@inproceedings{Daley81, title = {Retraceability, Repleteness and Busy Beaver Sets}, author = {Robert P. Daley}, year = {1981}, researchr = {https://researchr.org/publication/Daley81}, cites = {0}, citedby = {0}, pages = {252-261}, booktitle = {Mathematical Foundations of Computer Science 1981, Strbske Pleso, Czechoslovakia, August 31 - September 4, 1981, Proceedings}, editor = {Jozef Gruska and Michal Chytil}, volume = {118}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {3-540-10856-4}, }