Zobrazeno 1 - 10
of 404
pro vyhledávání: '"Dennunzio, A"'
Endowing the set of functional graphs (FGs) with the sum (disjoint union of graphs) and product (standard direct product on graphs) operations induces on FGs a structure of a commutative semiring R. The operations on R can be naturally extended to th
Externí odkaz:
http://arxiv.org/abs/2402.16923
We provide an easily checkable algebraic characterization of positive expansivity for Additive Cellular Automata over a finite abelian group. First of all, an easily checkable characterization of positive expansivity is provided for the non trivial s
Externí odkaz:
http://arxiv.org/abs/2308.03064
This paper provides an algorithmic pipeline for studying the intrinsic structure of a finite discrete dynamical system (DDS) modelling an evolving phenomenon. Here, by intrinsic structure we mean, regarding the dynamics of the DDS under observation,
Externí odkaz:
http://arxiv.org/abs/2211.05038
We investigate the computational complexity of deciding whether a given univariate integer polynomial p(x) has a factor q(x) satisfying specific additional constraints. When the only constraint imposed on q(x) is to have a degree smaller than the deg
Externí odkaz:
http://arxiv.org/abs/2210.07030
Publikováno v:
IEEE Access, Vol 12, Pp 122061-122077 (2024)
During the last few decades, significant efforts have been devoted to analyze the dynamical behavior of cellular automata (CAs) on cyclic groups, their Cartesian power (referred to as linear cellular automata), and on general abelian groups (referred
Externí odkaz:
https://doaj.org/article/4e7b32f042a046ca99aedd51a315ee9f
Publikováno v:
In Information Sciences February 2024 657
Let $\mathbb{K}$ be a finite commutative ring, and let $\mathbb{L}$ be a commutative $\mathbb{K}$-algebra. Let $A$ and $B$ be two $n \times n$-matrices over $\mathbb{L}$ that have the same characteristic polynomial. The main result of this paper stat
Externí odkaz:
http://arxiv.org/abs/1907.08565
Boolean automata networks, genetic regulation networks, and metabolic networks are just a few examples of biological modelling by discrete dynamical systems (DDS). A major issue in modelling is the verification of the model against the experimental d
Externí odkaz:
http://arxiv.org/abs/1904.13115
Publikováno v:
Information and Computation, Volume 267, August 2019, Pages 96-109
Reaction systems are discrete dynamical systems inspired by bio-chemical processes, whose dynamical behaviour is expressed by set-theoretic operations on finite sets. Reaction systems thus provide a description of bio-chemical phenomena that compleme
Externí odkaz:
http://arxiv.org/abs/1903.07913
Publikováno v:
Information Sciences 486 (2019) 73-87
Higher-order cellular automata (HOCA) are a variant of cellular automata (CA) used in many applications (ranging, for instance, from the design of secret sharing schemes to data compression and image processing), and in which the global state of the
Externí odkaz:
http://arxiv.org/abs/1902.06775