@inproceedings{4dbbeb2b1d8f4be8a308cd40c573d188,
title = "Counting ordered patterns in words generated by morphisms",
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.",
keywords = "morphisms, patterns, rises, inversions, repititions",
author = "Sergey Kitaev and Toufik Mansour and Patrice Seebold",
year = "2008",
doi = "10.1007/978-3-540-88282-4_27",
language = "English",
isbn = "9783540882817",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "287--298",
editor = "{Mart{\'i}n-Vide }, Carlos and Friedrich Otto and Henning Fernau",
booktitle = "Language and Automata Theory and Applications",
note = "2nd International Conference on Language and Automata Theory and Applications (LATA) ; Conference date: 13-03-2008 Through 19-03-2008",
}