Pattern avoiding and
We provide a bijection between the set of the q-decreasing binary words (in the case where q is an irreducible positive rational number) and a set of binary words avoiding some patterns whose lengths depends on the number q. Moreover, for such a set we give the details of the construction, the generating function according to the length of its words, and the recurrence relation of the enumerating sequence, depending on q.
Authors
- Stefano Bilotta (ORCID: https://orcid.org/0000-0002-6947-762X)
- Elena Barcucci (ORCID: https://orcid.org/0000-0002-5646-4790)
- Renzo Pinzani
- Antonio Bernini
Publication Details
- Journal
- Springer Link (Chiba Institute of Technology)
- Published
- 2025-10-17
- DOI
- https://doi.org/10.1051/ita/2025013/pdf
- Primary Topic
- semigroups and automata theory
- Type
- article
- Field-Weighted Citation Impact
- 0.00