We start a general study of counting the number of occurrences of ordered patterns in words generated by morphisms. We consider certain patterns with gaps (classical patterns) and that with no gaps (consecutive patterns). Occurrences of the patterns are known, in the literature, as rises, descents, (non-)inversions, squares and p-repetitions. We give recurrence formulas in the general case, then deducing exact formulas for particular families of morphisms. Many (classical or new) examples are given illustrating the techniques and showing their interest. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Kitaev, S., Mansour, T., & Séébold, P. (2008). Counting ordered patterns in words generated by morphisms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5196 LNCS, pp. 287–298). https://doi.org/10.1007/978-3-540-88282-4_27
Mendeley helps you to discover research relevant for your work.