A combinatorial theorem on $p$-power-free words and an application to semigroups (Q3479530)

From MaRDI portal
Revision as of 13:27, 7 October 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
A combinatorial theorem on $p$-power-free words and an application to semigroups
scientific article

    Statements

    A combinatorial theorem on $p$-power-free words and an application to semigroups (English)
    0 references
    0 references
    0 references
    1990
    0 references
    infinite words
    0 references
    subword complexity
    0 references

    Identifiers