The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
We first prove an extremal property
of the infinite Fibonacci
word : the family of the palindromic prefixes
{} of
is not only a circular code but “almost” a comma-free one
(see Prop. 12 in Sect. 4).
We also extend to a more general situation
the notion of a necklace introduced
for the study of trinucleotides codes on the genetic alphabet,
and we present a hierarchy
relating two important classes of codes,
the comma-free codes and the circular ones.
Here we give a characterization of Arnoux–Rauzy sequences by the way of the lexicographic orderings of their alphabet.
Here we give a characterization of Arnoux–Rauzy sequences by the way of
the lexicographic orderings of their alphabet.
Sia S un semigruppo finitamente generato. Se per ogni coppia x,y di elementi di S si ha che xy oppure yx è un idempotente allora S è finito.
Download Results (CSV)