Polynomial Equations over Finite, Discrete-Time Dynamical Systems
From MaRDI portal
Recommendations
Cites work
Cited in
(21)- Finite input/output representative of a class of Volterra polynomial systems
- Sequential dynamics of high order polynomial automata networks: An application to the Erlang fixed-point equations
- Uncertainty representation in dynamical systems using rough set theory
- MDDs boost equation solving on discrete dynamical systems
- Reverse-engineering of polynomial dynamical systems
- Solution of stiff dynamical systems via piecewise-linear polynomial functions
- scientific article; zbMATH DE number 493127 (Why is no real title available?)
- scientific article; zbMATH DE number 2064551 (Why is no real title available?)
- Dynamical equivalence and unbounded polynomial differential systems
- On Boolean automata networks (de)composition
- Polynomials with multiple zeros and solvable dynamical systems including models in the plane with polynomial interactions
- Analytical approach for simplifying dynamical systems of polynomial type.
- Factorisation in the semiring of finite dynamical systems
- Decomposition and factorisation of transients in functional graphs
- Polynomial-delay generation of functional digraphs up to isomorphism
- Dividing permutations in the semiring of functional digraphs
- Roots in the semiring of finite deterministic dynamical systems
- Solving ``pseudo-injective polynomial equations over finite dynamical systems
- Injectivity of polynomials over finite discrete dynamical systems
- There is no prime functional digraph: Seifert's proof revisited
- On solving basic equations over the semiring of functional digraphs
This page was built for publication: Polynomial Equations over Finite, Discrete-Time Dynamical Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6108527)