Discrete Applied MathematicsVolume 55, Issue 1, 28 October 1994, Pages 83-86NoteSome combinatorial properties of self-reading sequencesAuthor links open overlay panelGabriel Istrate, Gheorghe PǎunShow moreShareCitehttps://doi.org/10.1016/0166-218X(94)90037-XGet rights and contentUnder an Elsevier user licenseopen archiveAbstractWe solve an open problem about the “self-reading sequences” considered in Pǎun and Salomaa (1993), namely we prove that all (nontrivial) such sequences contain every binary string. Some consequences of this result are derived, too.Previous article in issueNext article in issueRecommended articlesCited by (0)Copyright © 1994 Published by Elsevier B.V.