Counting ordered patterns in words generated by morphisms

Kitaev, Sergey and Mansour, Toufik and Seebold, Patrice; Martín-Vide, Carlos and Otto, Friedrich and Fernau, Henning, eds. (2008) Counting ordered patterns in words generated by morphisms. In: Language and Automata Theory and Applications. Lecture Notes in Computer Science . Springer, ESP, pp. 287-298. ISBN 9783540882817 (https://doi.org/10.1007/978-3-540-88282-4_27)

Full text not available in this repository.Request a copy

Abstract

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.

ORCID iDs

Kitaev, Sergey ORCID logoORCID: https://orcid.org/0000-0003-3324-1647, Mansour, Toufik and Seebold, Patrice; Martín-Vide, Carlos, Otto, Friedrich and Fernau, Henning
CORE (COnnecting REpositories)