Multiset and K -Subset Transforming Systems

Authors:
Taishin Y. Nishida
Affiliations:
-
Venue:
WMP '00 Proceedings of the Workshop on Multiset Processing: Multiset Processing, Mathematical, Computer Science, and Molecular Computing Points of View
Year:
2000

Citing 8
Cited 0

Formal languages

Formal languages
A parallel machine for multiset transformation and its programming style

Future Generation Computer Systems
Programming by multiset transformation

Communications of the ACM
Refining multiset transformers

Theoretical Computer Science - Special issue: theoretical aspects of coordination languages
Computing with membranes

Journal of Computer and System Sciences
Automata, Languages, and Machines

Automata, Languages, and Machines
Developmental Systems and Languages

Developmental Systems and Languages
Algorithms for quantum computation: discrete logarithms and factoring

SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce K-subset transforming systems as a generalization of multiset transformation. A K-subset, which is a generalization of a multiset where "multiplicities" take values in 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.