On optimum time bounds for recognition of some sets of words by on-line Turing machines