VOLUME 21 2016 NUMBER 3

Counting Occurrences of a Pattern of Length Three With at Most Two Distinct Letters in a k-ary Word
Toufik Mansour, Armend Sh. Shabani
Pages 183–201





Download Abstract
Fulltext is accessible with your personal account
ShowHide BibTeX
BibTeX:
@article{JALC-2016-183,
  author  = {Toufik Mansour and Armend Sh. Shabani},
  title   = {Counting Occurrences of a Pattern of Length Three With at Most Two Distinct Letters in a $k$-ary Word},
  journal = {Journal of Automata, Languages and Combinatorics},
  volume  = {21},
  number  = {3},
  pages   = {183--201},
  year    = {2016},
  url     = {https://doi.org/10.25596/jalc-2016-183},
  doi     = {10.25596/jalc-2016-183}
}
If you would like to see an embedded preview, try to select preview as the action for Portable Document Format (PDF) in your brower settings.
Keywords: k-ary word, pattern, enumeration, generating function, Eulerian polynomial
DOI: 10.25596/jalc-2016-183