Red-Green P Automata

dc.creator	Aman, Bogdan
dc.creator	Csuhaj Varjú, Erzsébet
dc.creator	Freund, Rudolf
dc.date.accessioned	2016-01-26T09:05:26Z
dc.date.available	2016-01-26T09:05:26Z
dc.date.issued	2014
dc.identifier.isbn	978-84-940056-4-0	es
dc.identifier.uri	http://hdl.handle.net/11441/33301
dc.description.abstract	In this short note we extend the notion of red-green Turing machines to speci c variants of P automata. Acceptance and recognizability of nite strings by red- green automata are de ned via in nite runs of the automaton on the input string and the way how to distinguish between red and green states.	es
dc.format	application/pdf	es
dc.language.iso	eng	es
dc.publisher	Fénix Editora	es
dc.relation.ispartof	Proceedings of the Twelfth Brainstorming Week on Membrane Computing, 73-78. Sevilla, E.T.S. de Ingeniería Informática, 3-7 de Febrero, 2014,	es
dc.rights	Attribution-NonCommercial-NoDerivatives 4.0 Internacional	*
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/4.0/	*
dc.title	Red-Green P Automata	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/33301

Ficheros	Tamaño	Formato	Ver	Descripción
073_bwmc2014RedGreen.pdf	64.64Kb	[PDF]	Ver/Abrir

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