Fibonacci morphisms and Sturmian words (Q1177169)

From MaRDI portal
Revision as of 14:34, 14 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Fibonacci morphisms and Sturmian words
scientific article

    Statements

    Fibonacci morphisms and Sturmian words (English)
    0 references
    0 references
    26 June 1992
    0 references
    The paper solves four problems on binary morphisms proposed by \textit{M. Kósa} [Bull. EATCS 32, 331-333 (1987)].
    0 references
    0 references
    Sturmian words
    0 references
    free monoids
    0 references
    morphisms
    0 references

    Identifiers