MATRIX INDICATORS FOR SUBWORD OCCURRENCES AND AMBIGUITY
Alexandru Mateescu, Arto K. Salomaa · International Journal of Foundations of Computer Science · 2004
The paper investigates inequalities between the numbers of different (scattered) subword occurrences. The Parikh matrix recently introduced is an efficient tool. We give various characterizations for Parikh matrices. Of special interest is the case where the matrix determines the word uniquely. We investigate such matrix unambiguous words. The considerations are extended to concern languages. Several open problems and problem areas are indicated.