Self-reading sequences

DOI10.1016/0166-218X(94)90087-6MaRDI QIDQ1326757zbMATH OpenFDO

Authors Gabriel Istrate

Publication date 29 November 1994

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0166-218X(94)90087-6

zbMATH Keywords

periodicityself-reading sequences

Mathematics Subject Classification ID

Automata sequences (11B85) Formal languages and automata (68Q45) Combinatorics on words (68R15)

Review text

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

Recommendations

• On disjunctivity, ultimate periodicity and ultimate identity of Păun-Salomaa self-reading sequences
• scientific article; zbMATH DE number 1311365
• Automatic sequences
• Self-Reading Sequences
• Binary self-adding sequences

Cited in

(7)

• Some combinatorial properties of self-reading sequences
• scientific article; zbMATH DE number 1311365 (Why is no real title available?)
• Binary self-adding sequences and languages¹
• Self-Reading Sequences
• Binary self-adding sequences
• On disjunctivity, ultimate periodicity and ultimate identity of Păun-Salomaa self-reading sequences
• Look, knave

This page was built for publication: Self-reading sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1326757)