TCS
2011
12 years 11 months ago
2011
We consider some Riordan arrays related to binary words avoiding a pattern p, which can be easily studied by means of an A-matrix rather than their A-sequence. Both concepts allow...
FUIN
2002
13 years 4 months ago
2002
In this paper we investigate the injectivity of the Parikh matrix mapping. This research is done mainly on the binary alphabet. We identify a family of binary words, refered to as...
TIT
2008
13 years 4 months ago
2008
The term binary combinatorial Gray code refers to a list of binary words such that the Hamming distance between two neighboring words is one and the list satisfies some additional ...
COMBINATORICS
2006
13 years 4 months ago
2006
We characterize the squares occurring in infinite overlap-free binary words and construct various power-free binary words containing infinitely many overlaps.
DM
2008
13 years 4 months ago
2008
We first give a bijective proof of Gould's identity in the model of binary words. Then we deduce Rothe's identity from Gould's identity again by a bijection, which a...