A combinatorial Gray code for a class of objects is a listing that contains each object from the
class exactly once such that any two consecutive objects in the list differ only by asmall …

A length n binary word is q-decreasing, q⩾ 1, if every of its maximal factors of the form 0 a 1
b satisfies a= 0 or q⋅ a> b. In particular, in 1-decreasing words every run of 0s is …

Non-overlapping codes are a set of codewords in, where, such that the prefix of each
codeword is not a suffix of any codeword in the set, including itself; and for variable-length …

A flip-swap language is a set S of binary strings of length n such that S∪{0 n} is closed
under two operations (when applicable):(1) Flip the leftmost 1; and (2) Swap the leftmost 1 …

Each strictly increasing sequence of positive integers can be used to define a numeration
system so that any non-negative integer can be represented by a suitable and unique string …

Given a sequence ${a_m} _ {mgeq 0} of strictly increasing positive integers such that $ a_0=
1$, any non-negative integer $ N $ can be uniquely represented by $ N= sum_ {igeq 0} d_i …

Each positive increasing integer sequence {an} n≥ 0 can serve as a numeration system to
represent each non-negative integer by means of suitable coefficient strings. We analyse the …

A Gray code for a combinatorial class is a method for listing the objects in the class so that
successive objects differ in some prespecified, small way, typically expressed as a bounded …

Dyck paths having height at most $ h $ and without valleys at height $ h-1$ are
combinatorially interpreted by means of 312-avoding permutations with some restrictions on …

We use Dyck paths having some restrictions in order to give a combinatorial interpretation
for some famous number sequences. Starting from the Fibonacci numbers we show how the …