Palindrome complexity. (Q1853729)

From MaRDI portal
Revision as of 09:24, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Palindrome complexity.
scientific article

    Statements

    title
    Palindrome complexity. (English)
    0 references
    author
    Julien Cassaigne
    0 references
    David Damanik
    0 references
    Jean-Paul Allouche
    0 references
    Michael Baake
    0 references
    publication date
    22 January 2003
    0 references
    zbMATH Keywords
    infinite sequences on finite alphabets
    0 references
    cites work
    Q4941509
    0 references
    Q5486010
    0 references
    Q4529547
    0 references
    Q2731274
    0 references
    Q5486009
    0 references
    Uniform tag sequences
    0 references
    Q2709131
    0 references
    Q4356052
    0 references
    Q4022829
    0 references
    Q4097906
    0 references
    Q2709125
    0 references

    Identifiers

    zbMATH DE Number
    1857208
    0 references
    arXiv ID
    math/0106121
    0 references
    OpenAlex ID
    W2912094370
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1853729&oldid=37067115"
    Powered by MediaWiki