Generating square-free words efficiently (Q496050): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Avoiding approximate repetitions with respect to the longest common subsequence distance / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Nonrepetitive sequences on arithmetic progressions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A constructive proof of the general lovász local lemma / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Application of entropy compression in pattern avoidance / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Two-Sided Bounds for the Growth Rates of Power-Free Languages / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Growth of Power-Free Languages over Large Alphabets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Growth properties of power-free languages / rank | |||
Normal rank |
Revision as of 18:26, 10 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Generating square-free words efficiently |
scientific article |
Statements
Generating square-free words efficiently (English)
0 references
16 September 2015
0 references
square-free word
0 references
random word
0 references
string algorithms
0 references
0 references