Itérations sur des ensembles finis et automates cellulaires contractants

From MaRDI portal
Publication:1137386

DOI10.1016/0024-3795(80)90251-7zbMath0428.68062OpenAlexW2002960642MaRDI QIDQ1137386

S. H. Smith

Publication date: 1980

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(80)90251-7




Related Items (21)

Complexity of limit-cycle problems in Boolean networksOn the robust synthesis of logical consensus algorithms for distributed intrusion detectionBistability and asynchrony in a Boolean model of the \textsc{L}-arabinose operon in \textit{Escherichia coli}Synchronizing Boolean networks asynchronouslyTurning block-sequential automata networks into smaller parallel networks with isomorphic limit dynamicsAbout block-parallel Boolean networks: a position paperOn the influence of the interaction graph on a finite dynamical systemThe maximal coordination principle in regulatory Boolean networksOn Fixable Families of Boolean NetworksFixing monotone Boolean networks asynchronouslyBoolean models of the transport, synthesis, and metabolism of tryptophan in \textit{Escherichia coli}Positive and negative cycles in Boolean networksStatic Analysis of Boolean Networks Based on Interaction Graphs: A SurveyA combinatorial analogue of the Jacobian problem in automata networksLocal negative circuits and fixed points in non-expansive Boolean networksOn the rank and periodic rank of finite dynamical systemsThéoremes de Perron-Frobenius et Stein-Rosenberg booleensSolution of the Boolean Markus-Yamabe problemOn Boolean automata isolated cycles and tangential double-cycles dynamicsDérivée discrete et comportement local d'une itération discreteFixed point theorems for Boolean networks expressed in terms of forbidden subnetworks



Cites Work


This page was built for publication: Itérations sur des ensembles finis et automates cellulaires contractants