ALGORITHMIC COMBINATORICS ON PARTIAL WORDS (Q4923275): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Francine Blanchet-Sadri / rank
Normal rank
 
Property / author
 
Property / author: Francine Blanchet-Sadri / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized String Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of sequences defined by billiard in the cube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rauzy's conjecture on billiards in the cube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Avoidable patterns in strings of symbols / 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: Constructing partial words with subword complexities not achievable by full words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Avoiding Abelian squares in partial words / rank
 
Normal rank
Property / cites work
 
Property / cites work: On minimal Sturmian partial words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Avoidable binary patterns in partial words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Erratum to: ``Avoidable binary patterns in partial words'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abelian repetitions in partial words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toeplitz words, generalized periodicity and periodically iterated morphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Avoiding Patterns in the Abelian Sense / rank
 
Normal rank
Property / cites work
 
Property / cites work: On abelian 2-avoidable binary patterns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Long binary patterns are abelian 2-avoidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly non-repetitive sequences and progression-free sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of sequences and dynamical systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The subword complexity of a class of infinite binary words / rank
 
Normal rank
Property / cites work
 
Property / cites work: A powerful abelian square-free substitution over 4 letters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Toeplitz sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: BLOCKING SETS OF TERMS / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1142/s0129054112400473 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4297931929 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:55, 30 July 2024

scientific article; zbMATH DE number 6171160
Language Label Description Also known as
English
ALGORITHMIC COMBINATORICS ON PARTIAL WORDS
scientific article; zbMATH DE number 6171160

    Statements

    ALGORITHMIC COMBINATORICS ON PARTIAL WORDS (English)
    0 references
    6 June 2013
    0 references
    combinatorics on words
    0 references
    partial words
    0 references
    pattern avoidrance
    0 references
    subword complexity
    0 references
    algorithms
    0 references

    Identifiers