Intrinsic universality in automata networks III: On symmetry versus asynchrony

An automata network is a finite assembly of interconnected entities endowed with a set of local maps defined over a common finite alphabet. These relationships are represented through an interaction graph. Together with the local functions, an assignment known as an update scheme directs the evoluti...

Full description

Saved in:

Bibliographic Details
Published in:	Theoretical computer science Vol. 1022; p. 114890
Main Authors:	Ríos-Wilson, Martín, Theyssier, Guillaume
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 29.12.2024 Elsevier
Subjects:	Asynchronous updates Automata networks Computational Complexity Computer Science Discrete Mathematics Dynamical Systems Intrinsic universality Mathematics Prediction problem Reachability problem Prediction problem Asynchronous updates Reachability problem Intrinsic universality Automata networks automata networks reachability problem asynchronous updates prediction problem intrinsic universality
ISSN:	0304-3975, 1879-2294
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!