Number of holes in unavoidable sets of partial words. II. (Q450549): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / author
 
Property / author: Francine Blanchet-Sadri / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68R15 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q17 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q45 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6082045 / rank
 
Normal rank
Property / zbMATH Keywords
 
automata and formal languages
Property / zbMATH Keywords: automata and formal languages / rank
 
Normal rank
Property / zbMATH Keywords
 
computational complexity
Property / zbMATH Keywords: computational complexity / rank
 
Normal rank
Property / zbMATH Keywords
 
combinatorics on words
Property / zbMATH Keywords: combinatorics on words / rank
 
Normal rank
Property / zbMATH Keywords
 
partial words
Property / zbMATH Keywords: partial words / rank
 
Normal rank
Property / zbMATH Keywords
 
unavoidable sets
Property / zbMATH Keywords: unavoidable sets / rank
 
Normal rank
Property / zbMATH Keywords
 
NP-hard problems
Property / zbMATH Keywords: NP-hard problems / rank
 
Normal rank

Revision as of 11:14, 30 June 2023

scientific article
Language Label Description Also known as
English
Number of holes in unavoidable sets of partial words. II.
scientific article

    Statements

    Number of holes in unavoidable sets of partial words. II. (English)
    0 references
    0 references
    0 references
    0 references
    13 September 2012
    0 references
    automata and formal languages
    0 references
    computational complexity
    0 references
    combinatorics on words
    0 references
    partial words
    0 references
    unavoidable sets
    0 references
    NP-hard problems
    0 references

    Identifiers