Factorisation in the semiring of finite dynamical systems
\'Emile Naquin, Maximilien Gadouleau

TL;DR
This paper explores the algebraic structure of finite dynamical systems (FDSs), focusing on their factorisation, division, and root problems within a semiring framework, and introduces unrolling to analyze their properties.
Contribution
It provides new characterizations of cancellative FDSs, proves the uniqueness of roots, and identifies classes of FDS monoids with unique factorisation, using unrolling techniques.
Findings
FDSs are cancellative iff they have a fixpoint.
k-th roots of FDSs are unique when they exist.
Certain FDS monoids exhibit unique factorisation properties.
Abstract
Finite dynamical systems (FDSs) are commonly used to model systems with a finite number of states that evolve deterministically and at discrete time steps. Considered up to isomorphism, those correspond to functional graphs. As such, FDSs have a sum and product operation, which correspond to the direct sum and direct product of their respective graphs; the collection of FDSs endowed with these operations then forms a semiring. The algebraic structure of the product of FDSs is particularly interesting. For instance, an FDS can be factorised if and only if it is composed of two sub-systems running in parallel. In this work, we further the understanding of the factorisation, division, and root finding problems for FDSs. Firstly, an FDS is cancellative if one can divide by it unambiguously, i.e. implies . We prove that an FDS is cancellative if and only if it has a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Control and Stability of Dynamical Systems
