Abstract:
We present lower bounds on complexity of separation of words by positions of subwords. In the case of subwords of length 1, we show that the bound is exact up to a constant factor. Applications to the problem of separation of words by automata are considered. Bibliogr. 6.
Keywords:subword, separation of words, cyclotomic polynomial, automaton.