Mostrar el registro sencillo del ítem

Ponencia

dc.creatorFrisco, Pierluigi
dc.date.accessioned2016-02-23T08:39:11Z
dc.date.available2016-02-23T08:39:11Z
dc.date.issued2004
dc.identifier.isbn84-688-6101-4
dc.identifier.urihttp://hdl.handle.net/11441/36314
dc.description.abstractIt is proved that four membranes su±ce to P systems with minimal symport/antiport to generate all recursively enumerable sets of numbers. It is also proved that P systems with symport/antiport without maximal par- allelism are equivalent to partially blind counter automata.es
dc.formatapplication/pdfes
dc.language.isoenges
dc.publisherFénix Editoraes
dc.relation.ispartofProceedings of the Second Brainstorming Week on Membrane Computing, 224-236. Sevilla, E.T.S. de Ingeniería Informática, 2-7 de Febrero, 2004es
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 Internacional*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/*
dc.titleAbout P Systems with Symport/Antiportes
dc.typeinfo:eu-repo/semantics/conferenceObjectes
dc.type.versioninfo:eu-repo/semantics/publishedVersiones
dc.rights.accessrightsinfo:eu-repo/semantics/openAccess
dc.identifier.idushttps://idus.us.es/xmlui/handle/11441/36314

FicherosTamañoFormatoVerDescripción
SYMANTI2.pdf158.2KbIcon   [PDF] Ver/Abrir  

Este registro aparece en las siguientes colecciones

Mostrar el registro sencillo del ítem

Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Excepto si se señala otra cosa, la licencia del ítem se describe como: Attribution-NonCommercial-NoDerivatives 4.0 Internacional