Counting Occurrences of a Pattern of Length Three with at most two Distinct Letters in a k-ary Word.

DOI10.25596/JALC-2016-183zbMATH Open1371.68223OpenAlexW2604859219MaRDI QIDQ5267520

Armend Shaban Shabani, Toufik Mansour

Publication date: 13 June 2017

Full work available at URL: https://doi.org/10.25596/jalc-2016-183

zbMATH Keywords

generating functionenumerationpatternEulerian polynomial\(k\)-ary word

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorics on words (68R15) Algorithms on strings (68W32)

Related Items (2)

The Lexicographic First Occurrence of a I-II-III pattern ⋮ Title not available (Why is that?)

This page was built for publication: Counting Occurrences of a Pattern of Length Three with at most two Distinct Letters in a k-ary Word.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5267520)