Vasile, Cristian IoanPavel, Ana BrandusaDumitrache, Ioan2016-02-052016-02-052012978-84-940056-6-4http://hdl.handle.net/11441/34150This paper provides the proof that Enzymatic Numerical P Sytems with deterministic, but parallel, execution model are universal, even when the production functions used are polynomials of degree 1. This extends previous known results and provides the optimal case in terms of polynomial degree.application/pdfengAttribution-NonCommercial-NoDerivatives 4.0 Internacionalhttp://creativecommons.org/licenses/by-nc-nd/4.0/Improving the Universality Results of Enzymatic Numerical P Systemsinfo:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/openAccess