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 QIDQ5267520FDOQ5267520

Authors: Toufik Mansour, Armend Sh. Shabani 

Publication date: 13 June 2017

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

Recommendations

• scientific article; zbMATH DE number 1919509
• Pattern occurrences in \(k\)-ary words revisited: a few new and old observations
• Restricted \(k\)-ary words and functional equations
• Longest alternating subsequences in pattern-restricted \(k\)-ary words
• The \(\mu\) pattern in words

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)

Cited In (10)

• Title not available (Why is that?)
• Counting ordered patterns in words generated by morphisms
• Restricted \(k\)-ary words and functional equations
• Words restricted by patterns with at most 2 distinct letters
• Longest alternating subsequences in pattern-restricted \(k\)-ary words
• Counting Ordered Patterns in Words Generated by Morphisms
• Title not available (Why is that?)
• Title not available (Why is that?)
• Enumeration of some classes of words avoiding two generalized patterns of length three
• The Lexicographic First Occurrence of a I-II-III pattern

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)