The reversibility of cellular automata on trees with loops

Título

dc.contributor.author	Martín del Rey, Ángel María
dc.contributor.author	Frutos Bernal, Elisa
dc.contributor.author	Hernández Serrano, Daniel
dc.contributor.author	Casado-Vara, Roberto
dc.date.accessioned	2022-05-27T10:55:19Z
dc.date.available	2022-05-27T10:55:19Z
dc.date.issued	2021
dc.identifier.citation	del Rey, A.M.,et al. (2021). The Reversibility of Cellular Automata on Trees with Loops. Advances in Intelligent Systems and Computing, vol 1237. Springer, Cham.	es_ES
dc.identifier.isbn	978-3-030-53035-8
dc.identifier.uri	http://hdl.handle.net/10366/149871
dc.description.abstract	[EN] In this work the notion of linear cellular automata on trees with loops is introduced and the reversibility problem in some particular cases is tackled. The explicit expressions of the inverse cellular automata are computed.	es_ES
dc.language.iso	eng	es_ES
dc.publisher	SpringerLink	es_ES
dc.relation.ispartofseries	AISC;1237
dc.rights	Attribution-NonCommercial-NoDerivatives 4.0 Internacional	*
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/4.0/	*
dc.subject	Cellular automata on graphs	es_ES
dc.subject	Reversibility	es_ES
dc.subject	Trees with loops	es_ES
dc.subject	Evolutionary computation	es_ES
dc.title	The reversibility of cellular automata on trees with loops	es_ES
dc.type	info:eu-repo/semantics/conferenceObject	es_ES
dc.subject.unesco	1203.04 Inteligencia Artificial	es_ES
dc.rights.accessRights	info:eu-repo/semantics/openAccess	es_ES