Abstract.In this paper, we establish a system of recurrence relations and an algorithm for finding the generating function Ak(x) for the number of words over alphabet [k] of length n that avoid 1243, for arbitrary k. In particular, we present an explicit formula for the generating function Ak(x) for 1 ≤ k ≤ 10.
No takes yet. Share an insight, caveat, or question.
Toufik Mansour (2024) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: