Minimizing evolution-communication P systems and automata

摘要: Evolution-communication P systems are a variant of allowing both rewriting rules and symport/antiport rules, thus having separated the communication. The purpose this paper is to solve an open problem stated in Reference [1], namely generating family Turing computable sets vectors natural numbers instead numbers. same construction also reduces 3-membrane non-cooperative case 2-membrane 1-catalyst case. Also, EC automata introduced it proved that with promoter can accept all recursively enumerable languages. Finally, definition extended system given, its universality using more restricted types.