On simulation in automata networks (Q2106612)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	On simulation in automata networks	scientific article

Statements

scholarly article

0 references

On simulation in automata networks (English)

0 references

Florian Bridoux

0 references

Maximilien Gadouleau

0 references

Guillaume Theyssier

0 references

publication date

16 December 2022

0 references

full work available at URL

https://arxiv.org/abs/2001.09198

0 references

MaRDI profile type

MaRDI publication profile

0 references

Complete simulation of automata networks

0 references

Commutative automata networks

0 references

Closed iterative calculus

0 references

Mapping Computation with No Memory

0 references

0 references

Computing in permutation groups without memory

0 references

On the influence of the interaction graph on a finite dynamical system

0 references

Simple dynamics on graphs

0 references

Memoryless computation: new results, constructions, and extensions

0 references

Classical finite transformation semigroups. An introduction.

0 references

Disjunctive networks and update schedules

0 references

PSPACE-completeness of majority automata networks

0 references

0 references

Synchronism versus asynchronism in monotonic Boolean automata networks

0 references

Computation on binary tree-networks

0 references

Graph puzzles, homotopy, and the alternating group

0 references

Cellular graph automata. I. basic concepts, graph property measurement, closure properties

0 references

Cellular graph automata. II. graph and subgraph isomorphism, graph structure recognition

0 references

Identifiers

10.1007/978-3-030-51466-2_24

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2106612

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2106612&oldid=37472638"