Γmile Naquin
Factorisation in the semiring of finite dynamical systems
Naquin, Γmile; Gadouleau, Maximilien
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 fixed point. Secondly, we prove that if an FDS π΄ has a π-th root (i.e. π΅ such that π΅π = π΄), then it is unique. Thirdly, unlike integers, the monoid of FDS product does not have unique factorisation into irreducibles. We instead exhibit a large class of monoids of FDSs with unique factorisation. To obtain our main results, we introduce the unrolling of an FDS, which can be viewed as a space-time expansion of the system. This allows us to work with (possibly infinite) trees, where the product is easier to handle than its counterpart for FDSs.
Citation
Naquin, Γ., & Gadouleau, M. (2024). Factorisation in the semiring of finite dynamical systems. Theoretical Computer Science, 998, Article 114509. https://doi.org/10.1016/j.tcs.2024.114509
Journal Article Type | Article |
---|---|
Acceptance Date | Mar 13, 2024 |
Online Publication Date | Mar 28, 2024 |
Publication Date | 2024-06 |
Deposit Date | May 9, 2024 |
Publicly Available Date | May 9, 2024 |
Journal | Theoretical Computer Science |
Print ISSN | 0304-3975 |
Publisher | Elsevier |
Peer Reviewed | Peer Reviewed |
Volume | 998 |
Article Number | 114509 |
DOI | https://doi.org/10.1016/j.tcs.2024.114509 |
Public URL | https://durham-repository.worktribe.com/output/2435886 |
Files
Published Journal Article
(874 Kb)
PDF
Licence
http://creativecommons.org/licenses/by/4.0/
Publisher Licence URL
http://creativecommons.org/licenses/by/4.0/
Copyright Statement
This is an open access article under the CC BY license
(http://creativecommons.org/licenses/by/4.0/).
You might also like
Graphs with minimum degree-entropy
(2024)
Journal Article
Graphs with minimum fractional domatic number
(2023)
Journal Article
Bent functions in the partial spread class generated by linear recurring sequences
(2022)
Journal Article
Expansive automata networks
(2020)
Journal Article
Elementary, finite and linear vN-regular cellular automata
(2020)
Journal Article
Downloadable Citations
About Durham Research Online (DRO)
Administrator e-mail: dro.admin@durham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search