Note
Some combinatorial properties of self-reading sequences

https://doi.org/10.1016/0166-218X(94)90037-XGet rights and content
Under an Elsevier user license
open archive

Abstract

We 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.

Cited by (0)