Zobrazeno 1 - 10
of 33
pro vyhledávání: '"Bridoux, Florian"'
An automata network with $n$ components over a finite alphabet $Q$ of size $q$ is a discrete dynamical system described by the successive iterations of a function $f:Q^n\to Q^n$. In most applications, the main parameter is the interaction graph of $f
Externí odkaz:
http://arxiv.org/abs/2409.08041
A Boolean network is a function $f:\{0,1\}^n\to\{0,1\}^n$ from which several dynamics can be derived, depending on the context. The most classical ones are the synchronous and asynchronous dynamics. Both are digraphs on $\{0,1\}^n$, but the synchrono
Externí odkaz:
http://arxiv.org/abs/2402.03092
An automata network with $n$ components over a finite alphabet $Q$ of size $q$ is a discrete dynamical system described by the successive iterations of a function $f:Q^n\to Q^n$. In most applications, the main parameter is the interaction graph of $f
Externí odkaz:
http://arxiv.org/abs/2301.01958
In this paper, we deal the following decision problem: given a conjunctive Boolean network defined by its interaction digraph, does it have a limit cycle of a given length k? We prove that this problem is NP-complete in general if k is a parameter of
Externí odkaz:
http://arxiv.org/abs/2203.11361
A Boolean network (BN) with $n$ components is a discrete dynamical system described by the successive iterations of a function $f:\{0,1\}^n \to \{0,1\}^n$. This model finds applications in biology, where fixed points play a central role. For example,
Externí odkaz:
http://arxiv.org/abs/2012.02513
Automata networks are mappings of the form f : Q Z $\rightarrow$ Q Z , where Q is a finite alphabet and Z is a set of entities; they generalise Cellular Automata and Boolean networks. An update schedule dictates when each entity updates its state acc
Externí odkaz:
http://arxiv.org/abs/2004.09806
An automata network is a finite graph where each node holds a state from some finite alphabet and is equipped with an update function that changes its state according to the configuration of neighboring states. More concisely, it is given by a finite
Externí odkaz:
http://arxiv.org/abs/2001.09198
Boolean networks are a general model of interacting entities, with applications to biological phenomena such as gene regulation. Attractors play a central role, and the schedule of entities update is a priori unknown. This article presents results on
Externí odkaz:
http://arxiv.org/abs/2001.07391
An Automata Network is a map ${f:Q^n\rightarrow Q^n}$ where $Q$ is a finite alphabet. It can be viewed as a network of $n$ entities, each holding a state from $Q$, and evolving according to a deterministic synchronous update rule in such a way that e
Externí odkaz:
http://arxiv.org/abs/1902.08007
Autor:
Bridoux, Florian
Publikováno v:
CiE 2018, Jul 2018, Kiel, France
In this article we consider finite automata networks (ANs) with two kinds of update schedules: the parallel one (all automata are updated all together) and the sequential ones (the automata are updated periodically one at a time according to a total
Externí odkaz:
http://arxiv.org/abs/1803.00438