Relationally Periodic Sequences and Subword Complexity (Q3533010): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-540-85780-8_15 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1504594137 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial words and a theorem of Fine and Wilf / rank
 
Normal rank
Property / cites work
 
Property / cites work: ALGORITHMIC COMBINATORICS ON PARTIAL WORDS / rank
 
Normal rank
Property / cites work
 
Property / cites work: The theorem of Fine and Wilf for relational periods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5387733 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compatibility relations on codes and free monoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4529547 / rank
 
Normal rank

Latest revision as of 19:23, 28 June 2024

scientific article
Language Label Description Also known as
English
Relationally Periodic Sequences and Subword Complexity
scientific article

    Statements

    Relationally Periodic Sequences and Subword Complexity (English)
    0 references
    0 references
    0 references
    0 references
    30 October 2008
    0 references
    0 references
    period
    0 references
    subword complexity
    0 references
    similarity relation
    0 references
    relational period
    0 references
    partial word
    0 references
    0 references