In a weighted voting game, each voter has given weight, and coalition of voters is successful if the sum their individual weights exceeds quota. Such systems translate idea that are not all equal by assigning them different weights. such situation, two symmetric in game interchanging leaves outcome unchanged. Two with same weight naturally every but converse statement necessarily true. We call ...

The sequential Context Tree Weighting procedure [6] achieves the asymptotically optimal redundancy behavior of k/2 · (log n)/n, where k is the number of free parameters of the source and n is the sequence length. For FSMX sources with an alphabet A, this number, k, is (|A| − 1) · |Ka|. However, especially the FSMX sources often use only a few possible letters in every state. It would be nice if...

4 The algorithms 4 4.1 Basic transformations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 4.1.1 Pitch intervals . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 4.1.2 Rhythmic quantisation and interonset intervals . . . . . . . . . . . 4 4.1.3 Rhythmical weighting (RW) . . . . . . . . . . . . . . . . . . . . . . 5 4.2 Auxiliary principles . . . . . . . . . . . . . ...