Counting ordered patterns in words generated by morphisms

Sergey Kitaev, Toufik Mansour, Patrice Séébold

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationLanguage and Automata Theory and Applications - Second International Conference, LATA 2008, Revised Papers
Pages287-298
Number of pages12
DOIs
StatePublished - 2008
Event2nd International Conference on Language and Automata Theory and Applications, LATA 2008 - Tarragona, Spain
Duration: 13 Mar 200819 Mar 2008

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5196 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference2nd International Conference on Language and Automata Theory and Applications, LATA 2008
Country/TerritorySpain
CityTarragona
Period13/03/0819/03/08

Keywords

  • Descents
  • Inversions
  • Morphisms
  • Patterns
  • Repetitions
  • Rises

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)

Fingerprint

Dive into the research topics of 'Counting ordered patterns in words generated by morphisms'. Together they form a unique fingerprint.

Cite this