Ternary Square-Free Partial Words with Many Wildcards

Gasnikov, Daniil; Shur, Arseny M.

doi:10.1007/978-3-662-53132-7_15

Search citation statements

Order By: Relevance

Paper Sections

Select...

Other Ternary Words1

Small Subword Complexity In Big Languages1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2019

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(2 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Observing that (1, 0, 0)A + (0, 0, 1) = (1, 1, 1), we can reduce (15) to (14). (The particular nonnegative vector does not matter; what matters is that the vector in the numerator and the denominator is the same.)…”

Section: Other Ternary Wordsmentioning

confidence: 99%

See 1 more Smart Citation

Subword complexity and power avoidance

Shallit

Shur

2019

Theoretical Computer Science

View full text Add to dashboard Cite

We begin a systematic study of the relations between subword complexity of infinite words and their power avoidance. Among other things, we show that -the Thue-Morse word has the minimum possible subword complexity over all overlapfree binary words and all ( 7 3 )-power-free binary words, but not over all ( 7 3 ) + -power-free binary words; -the twisted Thue-Morse word has the maximum possible subword complexity over all overlap-free binary words, but no word has the maximum subword complexity over all ( 7 3 )-power-free binary words; -if some word attains the minimum possible subword complexity over all square-free ternary words, then one such word is the ternary Thue word; -the recently constructed 1-2-bonacci word has the minimum possible subword complexity over all symmetric square-free ternary words.

show abstract

Section: Other Ternary Wordsmentioning

confidence: 99%

“…This word was introduced by Petrova [25], who proved that F 12 has critical exponent 11/6 (reachable) and no length-5 factors of the form abcab. Also, F 12 appeared to have a nice extremal property [15,Proposition 13].…”

Section: Small Subword Complexity In Big Languagesmentioning

confidence: 99%

Subword complexity and power avoidance

Shallit

Shur

2019

Theoretical Computer Science

View full text Add to dashboard Cite

show abstract

Ternary Square-Free Partial Words with Many Wildcards

Cited by 1 publication

References 13 publications

Subword complexity and power avoidance

Subword complexity and power avoidance

Contact Info

Product

Resources

About