Abstract.
We introduce K-subset transforming systems as a generalization of multiset transformation. A K-subset, which is a generalization of a multiset of which "multiplicities" is take values of a semiring, is considered by S. Eilenberg. We construct an example of K -subset transforming system which models a chaotic discrete dynamical system. We show that for every basic reaction of multiset transformation we can construct a K-subset transforming system which expresses the multiset transformation. We also show that for every phrase structure grammar there is a K-subset transforming system such that the system simulates derivations of the grammar. We a define probabilistic model of K-subset transforming system and give an example of it which describe the Belousov-Zhabotinsky reaction.