Hence, computing all such words naïvely can be a very time-consuming procedure, in particular for large k.   RESULTS In this article, we propose an [Formula: see text]-time and [Formula: see text]-space algorithm to compute all [Formula: see text]-avoided words of length k in a given sequence of length n over a fixed-sized alphabet.