Abstract:
We introduce a computing mechanism of a biochemical inspiration
(similar to a P system in the area of computing by membranes) which consists
of a multiset of symbol-objects and a set of finite state sequential transducers.
The transducers process symbols in the current multiset in the usual manner. A
computation starts in an initial configuration and ends in halting configuration.
The power of these mechanisms is investigated (the main result says that systems
with two components generate all gsm images of all permutations of recursively
enumerable languages), as well as the closure properties of the obtained family
(which is shown to be a full AFL).