6533b828fe1ef96bd1288c1a
RESEARCH PRODUCT
Gray visiting Motzkins
Vincent Vajnovszkisubject
Computer Networks and CommunicationsGeneralizationComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISIONCombinatoricsGray codeColoredAlgorithmicsMotzkin numberCode (cryptography)ArithmeticGray (horse)SoftwareWord (group theory)Information SystemsMathematicsdescription
We present the first Gray code for Motzkin words and their generalizations: k colored Motzkin words and Schroder words. The construction of these Gray codes is based on the observation that a k colored Motzkin word is the shuffle of a Dyck word by a k-ary variation on a trajectory which is a combination. In the final part of the paper we give some algorithmic considerations and other possible applications of the techniques introduced here.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 2002-11-01 | Acta Informatica |