Separating words by occurrences of subwords
- 61 Downloads
We obtain some lower bounds for the complexity of word separation by occurrences of subwords. In the case of length 1 subwords, we show that the bound is exact up to a constant factor. Connection with the problem of separating words by automata is considered.
Keywordssubword word separation cyclotomic polynomial automaton
Unable to display preview. Download preview PDF.
- 3.E. D. Demaine, S. Eisenstat, J. Shallit, and D. A. Wilson, “Remarks on SeparatingWords,” in Lecture Notes in Computer Science, Vol. 6808: Descriptional Complexity of Formal Systems(2011), pp. 147–157.Google Scholar
- 4.J. Karhumaki, S. Puzynina, and A. Saarela, “Fine and Wilf’s Theorem for k-Abelian Periods,” in Lecture Notes in Computer Science, Vol. 7410: Developments in Language Theory(2012), pp. 296–307.Google Scholar