DNA computing based on splicing: universality results

摘要: First, we recall some characterizations of recursively enumerable languages by means finite H systems with certain regulations on the splicing operation. Then, consider a variant operation where proceeds always in couples steps: two strings obtained after enter immediately second (the rules used steps are not prescribed). Somewhat surprising if take into account loose control performed operations, extended sets axioms and rules, using this double operation, can again characterize languages. Finally, types distributed systems: communicating time-varying systems. For first type devices, give new proof recent result [25] that (in case) such three components In what concerns mentioned model, prove seven The optimality these last-mentioned results is open.