An infinite square-free co-CFL

Authors:
Michael G. Main
Affiliations:
Univ. of Colorado, Boulder
Venue:
Information Processing Letters
Year:
1985

Citing 0
Cited 4

Pattern avoidance: themes and variations

Theoretical Computer Science - Combinatorics on words
An efficient algorithm for online square detection

Theoretical Computer Science - Computing and combinatorics
Dejean's conjecture and Sturmian words

European Journal of Combinatorics
Note: Palindrome positions in ternary square-free words

Theoretical Computer Science

Quantified Score

Hi-index	0.89

Visualization

Abstract