Explores string attractors combinatorially across families of finite words and suggests they can serve as new tools for investigating word properties.
SIAM Journal on Computing 6(2), 323–350 (1977)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
String Attractors and Combinatorics on Words
Explores string attractors combinatorially across families of finite words and suggests they can serve as new tools for investigating word properties.