scientific article; zbMATH DE number 3995996

MaRDI QIDQ4723969zbMATH OpenFDO

Authors Veikko Keränen

Publication date 1987

zbMATH Keywords

k-free morphismsprimitive ps-code

Mathematics Subject Classification ID

Semigroups in automata theory, linguistics, etc. (20M35) Formal languages and automata (68Q45) Prefix, length-variable, comma-free codes (94A45)

Recommendations

• scientific article; zbMATH DE number 3975229
• scientific article; zbMATH DE number 3911729
• A characterization of power-free morphisms
• On k-repetition freeness of length uniform morphisms over a binary alphabet
• A test-set fork-power-free binary morphisms

Cited in

(10)

• Free adjunction of morphisms
• Some non finitely generated monoids of repetition-free endomorphisms.
• A characterization of free pairs of upper triangular free monoid morphisms
• Unambiguous erasing morphisms in free monoids
• scientific article; zbMATH DE number 3975229 (Why is no real title available?)
• On the complexity of free monoid morphisms
• scientific article; zbMATH DE number 1047906 (Why is no real title available?)
• Abelian squares are avoidable on 4 letters
• A powerful abelian square-free substitution over 4 letters
• On the entropy and letter frequencies of powerfree words

This page was built for publication:

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