Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Counting occurrences ...
Article

Counting occurrences of some subword patterns

Alexander Burstein ORCID (1), Toufik Mansour ORCID (2)
(1) Department of Mathematics [IOWA]
(2) Laboratoire Bordelais de Recherche en Informatique
Download article
Open on HAL
Imported on
March 26, 2015
Published on
January 1, 2003
Last modified on
March 31, 2025
Volume 6
vol. 6:1
DOI
10.46298/dmtcs.320
License
https://about.hal.science/hal-authorisation-v1
Indicators
729
Views
865
Downloads

Counting occurrences of some subword patterns

Alexander Burstein ORCID (1), Toufik Mansour ORCID (2)
(1) Department of Mathematics [IOWA]
(2) Laboratoire Bordelais de Recherche en Informatique
Abstract
We find generating functions the number of strings (words) containing a specified number of occurrences of certain types of order-isomorphic classes of substrings called subword patterns. In particular, we find generating functions for the number of strings containing a specified number of occurrences of a given 3-letter subword pattern.
Keywords
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • Generalized patterns
  • subword patterns
Cited by

Source: OpenCitations

  • Enumeration of non-crossing partitions according to subwords with repeated letters

    Applicable Analysis and Discrete Mathematics

    Authors : Mark Shattuck ORCID

    Journal reference : Volume 19, 2024, pp. 1-20

    DOI : 10.2298/aadm211221017s

  • Counting adjacencies with difference at most one in -ary words

    Ars Combinatoria

    Authors : Sela Fried ORCID, Mark Shattuck ORCID

    Journal reference : Volume 164, 2025, pp. 57-75

    DOI : 10.61091/ars164-04
Preview
Loading PDF preview...