






























In this paper, we derive exact formulas for generating functions counting the number of $n$-ary words avoiding strictly increasing subwords of length $k$, and provide some applications of these formulas.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。