Supervised Classification for the Triple Parity Strings

A method is proposed for supervised learning to classify bit strings for three classes. The learner was modeled by two formal con- cepts: transformation system and stability optimization. Even though a small set of short examples were used in the training stage, all bit strings of any length were classi.ed correctly in the online recognition stage. The learner successfully learned to devise a way by means of metric calcula- tions to classify bit strings according to 3-parity-ness while the learner was never told the concept of 3-parity-ness.