2016-02-232016-02-23200484-688-6101-4http://hdl.handle.net/11441/36327This article shows how the computational universality can be reached by using P systems with object rewriting context-free rules, promot- ers/inhibitors and one catalyst. Both generative and accepting cases are stud- ied. Some examples that illustrate the theoretical issues are also presented.application/pdfengAttribution-NonCommercial-NoDerivatives 4.0 Internacionalhttp://creativecommons.org/licenses/by-nc-nd/4.0/info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/openAccesshttps://idus.us.es/xmlui/handle/11441/36327