On a class of infinite words with affine factor complexity.

Julien Bernat Zuzana Masáková Edita Pelantová

Published in: Theor. Comput. Sci. (2007)

Keyphrases

decision problems
tractable cases
affine invariant
keywords
n gram
affine transformation
finite dimensional
regular languages
text classification
finite sets