Decomposition and factorisation of transients in functional graphs
From MaRDI portal
Publication:6496877
DOI10.1016/J.TCS.2024.114514MaRDI QIDQ6496877
François Doré, Antonio E. Porreca, Sara Riva, Enrico Formenti
Publication date: 6 May 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Cites Work
- Unnamed Item
- On direct product cancellation of graphs
- MDDs boost equation solving on discrete dynamical systems
- Zero divisors among digraphs
- On the cancellation law among finite relational structures
- The Kronecker Product of Graphs
- The asymptotic number of attractors in the random map model
- Grasping the connectivity of random functional graphs
- The Expected Number of Components Under a Random Mapping Function
- Probability of Indecomposability of a Random Mapping Function
- Polynomial Equations over Finite, Discrete-Time Dynamical Systems
This page was built for publication: Decomposition and factorisation of transients in functional graphs