Show simple item record

dc.creator Krithivasan, Kamala
dc.creator Paun, Gheorghe
dc.creator Ramanujan, Ajeesh
dc.date.accessioned 2016-02-02T09:10:18Z
dc.date.available 2016-02-02T09:10:18Z
dc.date.issued 2013
dc.identifier.isbn 978-84-940691-9-2 es
dc.identifier.uri http://hdl.handle.net/11441/33789
dc.description.abstract We introduce and brie y investigate P systems with controlled computations. First, P systems with label restricted transitions are considered (in each step, all rules used have either the same label, or, possibly, the empty label, ), then P systems with the computations controlled by languages (as in context-free controlled grammars). The relationships between the families of sets of numbers computed by the various classes of controlled P systems are investigated, also comparing them with length sets of languages in Chomsky and Lindenmayer hierarchies (characterizations of the length sets of ET0L and of recursively enumerable languages are obtained in this framework). A series of open problems and research topics are formulated. es
dc.format application/pdf es
dc.language.iso eng es
dc.publisher Fénix Editora es
dc.relation.ispartof Proceedings of the Eleventh Brainstorming Week on Membrane Computing, 137-152. Sevilla, E.T.S. de Ingeniería Informática, 4-8 de Febrero, 2013, es
dc.rights Attribution-NonCommercial-NoDerivatives 4.0 Internacional *
dc.rights.uri http://creativecommons.org/licenses/by-nc-nd/4.0/ *
dc.title On Controlled P Systems es
dc.type info:eu-repo/semantics/conferenceObject es
dc.type.version info:eu-repo/semantics/publishedVersion es
dc.rights.accessrights info:eu-repo/semantics/openAccess
dc.identifier.idus https://idus.us.es/xmlui/handle/11441/33789
Size: 274.4Kb
Format: PDF

This item appears in the following Collection(s)

Show simple item record