PCol Automata: Recognizing Strings with P Colonies

dc.creator	Cienciala, Ludek
dc.creator	Ciencialová, Lucie
dc.creator	Csuhaj Varjú, Erzsébet
dc.creator	Vaszil, György
dc.date.accessioned	2016-03-28T07:53:05Z
dc.date.available	2016-03-28T07:53:05Z
dc.date.issued	2010
dc.identifier.isbn	9788461423576	es
dc.identifier.uri	http://hdl.handle.net/11441/38990
dc.description.abstract	We introduce the concept of a P colony automaton, an automata-like con- struct combining properties of finite automata and P colonies. We present some preliminary results on the accepting power of several variants of these extremely simple language recognizing devices, and propose problems for future research.	es
dc.format	application/pdf	es
dc.language.iso	eng	es
dc.publisher	Fénix Editora	es
dc.relation.ispartof	Proceedings of the Eighth Brainstorming Week on Membrane Computing, 65-76. Sevilla, E.T.S. de Ingeniería Informática, 1-5 de Febrero, 2010	es
dc.rights	Attribution-NonCommercial-NoDerivatives 4.0 Internacional	*
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/4.0/	*
dc.title	PCol Automata: Recognizing Strings with P Colonies	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/38990

Ficheros	Tamaño	Formato	Ver	Descripción
05CiencialaCiencialovaCsuhajVa ...	173.0Kb	[PDF]	Ver/Abrir

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