ON INEQUALITIES BETWEEN SUBWORD HISTORIES
Szilárd Zsolt Fazekas · International Journal of Foundations of Computer Science · 2008
In this paper we study subword inequalities, that is, inequalities between the number of occurrences of certain scattered subwords in a word. The problem of deciding whether a subword inequality holds for all words was proposed in [5]. We provide partial results describing a few cases in which the subword inequalities hold. Whether a subword inequality falls in these categories is decidable. However, the general question remains open.