Complete simulation of automata networks
From MaRDI portal
Publication:2301357
DOI10.1016/j.jcss.2019.12.001zbMath1435.68148arXiv1504.00169OpenAlexW2991850798MaRDI QIDQ2301357
Alonso Castillo-Ramirez, Maximilien Gadouleau, Florian Bridoux
Publication date: 24 February 2020
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1504.00169
symmetric grouptransformation semigroupsmodels of computationautomata networkscomputational difficultymemoryless computationcomplete simulation
Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Algebraic theory of languages and automata (68Q70) Other nonclassical models of computation (68Q09)
Related Items
On the influence of the interaction graph on a finite dynamical system ⋮ On simulation in automata networks
Cites Work
- Unnamed Item
- Unnamed Item
- Memoryless computation: new results, constructions, and extensions
- Computation on binary tree-networks
- Parallel calculation of a linear mapping on a computer network
- Parallel realization of permutations over trees
- A note on isomorphic simulation of automata by networks of two-state automata
- Closed iterative calculus
- Computation of Boolean functions on networks of binary automata
- Quadratic sequential computations of Boolean mappings
- Sequential computation of linear Boolean mappings
- Sequentialization and procedural complexity in automata networks
- Elementary decompositions of arbitrary maps over finite sets
- Mapping Computation with No Memory
- Permutation Factorization on Star-Connected Networks of Binary Automata
- Network information flow
- Three generators for minimal writing-space computations
- Algebraic Theory of Automata Networks
- Computing in permutation groups without memory
- Computing in matrix groups without memory
