Discrete Mathematics & Theoretical Computer Science
| author: | Alexander Burstein and Toufik Mansour |
|---|---|
| title: | Counting occurrences of some subword patterns |
| keywords: | Generalized patterns, subword patterns |
| 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.
If your browser does not display the abstract correctly (because of the different mathematical symbols) you can look it up in the PostScript or PDF files. |
| reference: | Alexander Burstein and Toufik Mansour (2003), Counting occurrences of some subword patterns, Discrete Mathematics and Theoretical Computer Science 6, pp. 1-12 |
| bibtex: | For a corresponding BibTeX entry, please consider our BibTeX-file. |
| ps.gz-source: | dm060101.ps.gz (37 K) |
| ps-source: | dm060101.ps (107 K) |
| pdf-source: | dm060101.pdf (100 K) |
The first source gives you the `gzipped' PostScript, the second the plain PostScript and the third the format for the Adobe accrobat reader. Depending on the installation of your web browser, at least one of these should (after some amount of time) pop up a window for you that shows the full article. If this is not the case, you should contact your system administrator to install your browser correctly.
Due to limitations of your local software, the two formats may show up differently on your screen. If eg you use xpdf to visualize pdf, some of the graphics in the file may not come across. On the other hand, pdf has a capacity of giving links to sections, bibliography and external references that will not appear with PostScript.