Self-reading sequences (Q1326757): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 12:24, 31 January 2024

scientific article
Language Label Description Also known as
English
Self-reading sequences
scientific article

    Statements

    Self-reading sequences (English)
    0 references
    0 references
    29 November 1994
    0 references
    \textit{G. Paun} and \textit{A. Salomaa} have defined [Bull. EATCS 50, 229-233 (1993)] some infinite one-sided binary strings they call ``self-reading sequences''. They left open a number of questions concerning some combinatorial properties of these sequences. We prove here a very simple lemma from which one can derive the non-ultimate periodicity of most of self-reading sequences, answering thus some of their questions. With a similar method one can prove (to appear in the same journal) that any finite word is a factor of such a sequence.
    0 references
    self-reading sequences
    0 references
    periodicity
    0 references

    Identifiers