Binary Amiable Words

Binary amiable words


Using the fact that the Parikh matrix mapping is not an injective mapping, the paper investigates some properties of the set of the binary words having the same Parikh matrix; these words are called “amiable”. Some results concerning the conditions when the equivalence classes of amiable words have more than one element, a characterization theorem and some basic properties of three distances defined on these classes are the main subjects considered here.

This guest lecture is dedicated in the memory of our former colleague in Turku and Bucharest, Professor Alexandru Mateescu.

Click here to get the lecture notes