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.
Type de document :
Article dans une revue
Integers : Electronic Journal of Combinatorial Number Theory, State University of West Georgia, Charles University, and DIMATIA, 2008, 8, pp.28
Liste complète des métadonnées

Littérature citée [27 références]  Voir  Masquer  Télécharger

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00382674
Contributeur : Patrice Séébold <>
Soumis le : dimanche 24 mars 2013 - 09:50:22
Dernière modification le : jeudi 24 mai 2018 - 15:59:21
Document(s) archivé(s) le : mardi 25 juin 2013 - 02:25:08

Fichier

PatternMorph.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : lirmm-00382674, version 1

Collections

Citation

Patrice Séébold, Sergey Kitaev, Toufik Mansour. Counting Ordered Patterns in Words Generated by Morphisms. Integers : Electronic Journal of Combinatorial Number Theory, State University of West Georgia, Charles University, and DIMATIA, 2008, 8, pp.28. 〈lirmm-00382674〉

Partager

Métriques

Consultations de la notice

232

Téléchargements de fichiers

70