Exponential lower bounds for the number of words of uniform length avoiding a pattern (Q2381499): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(12 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: JODO / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: NAIVE / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: DAVID_IAN / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: GJseries / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: GJsqfree / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: BLANKS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SPGJ / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SYMGJ / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: GJSAW / rank
 
Normal rank
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.1016/j.ic.2007.02.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2159509242 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3207176 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Avoidable patterns in strings of symbols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3704906 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniformly growing k-th power-free homomorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open Problems in Pattern Avoidance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pattern avoidance: themes and variations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial versus exponential growth in repetition-free binary words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4529547 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4693177 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unending chess, symbolic dynamics and a problem in semi-groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4132479 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Goulden—Jackson cluster method: extensions, applications and implementations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040049 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:41, 26 June 2024

scientific article
Language Label Description Also known as
English
Exponential lower bounds for the number of words of uniform length avoiding a pattern
scientific article

    Statements

    Exponential lower bounds for the number of words of uniform length avoiding a pattern (English)
    0 references
    0 references
    0 references
    18 September 2007
    0 references
    pattern avoidance
    0 references
    combinatorics on words
    0 references
    avoidable patterns
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers