Minimum Number of Holes in Unavoidable Sets of Partial Words of Size Three (Q3000493): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On regularity of context-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: UNAVOIDABLE SETS OF CONSTANT LENGTH / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal test on finite unavoidable sets of words / rank
 
Normal rank
Property / cites work
 
Property / cites work: On extendibility of unavoidable sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crucial words and the complexity of some extremal problems for sets of prohibited words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unavoidable sets / 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: Unavoidable sets of words of uniform length / 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 Deciding Avoidability of Sets of Partial Words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4529547 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unavoidable sets of partial words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3018955 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Combinatorics on Partial Words / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the synchronizing properties of certain prefix codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of Golomb's conjecture for the de Bruijn graph / rank
 
Normal rank

Latest revision as of 02:21, 4 July 2024

scientific article
Language Label Description Also known as
English
Minimum Number of Holes in Unavoidable Sets of Partial Words of Size Three
scientific article

    Statements

    Minimum Number of Holes in Unavoidable Sets of Partial Words of Size Three (English)
    0 references
    0 references
    0 references
    19 May 2011
    0 references
    0 references
    combinatorics on words
    0 references
    unavoidable
    0 references
    partial words
    0 references
    0 references