Abelian complexity of infinite words associated with quadratic Parry numbers.

L'ubomíra Balková Karel Brinda Ondrej Turek

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

Keyphrases

computational complexity
worst case
n gram
objective function
data sets
neural network
keywords
pairwise
computational cost