Unavoidable sets of partial words (Q733729): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q61719047, #quickstatements; #temporary_batch_1711439739529
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Efficient string matching / 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: Two Element Unavoidable Sets of Partial Words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing avoidability on sets of partial words is hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Computing the Capacity of Codes That Avoid Forbidden Difference Patterns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unavoidable binary patterns / rank
 
Normal rank
Property / cites work
 
Property / cites work: On extendibility of unavoidable sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On regularity of context-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: DNA Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4529547 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unavoidable languages, cuts and innocent sets of words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inventories of unavoidable languages and the word-extension conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every binary pattern of length six is avoidable on the two-letter alphabet / rank
 
Normal rank

Latest revision as of 02:19, 2 July 2024

scientific article
Language Label Description Also known as
English
Unavoidable sets of partial words
scientific article

    Statements

    Unavoidable sets of partial words (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    19 October 2009
    0 references
    0 references
    combinatorics on words
    0 references
    partial words
    0 references
    unavoidable sets
    0 references
    0 references
    0 references