Abstract
AbstractIn this paper we study the complexity of the decision problems about generic properties on the dynamics of finite discrete dynamical systems (fDDS). Properties are grouped into two main classes : local and global. Local properties are at most in \(\textsf {NP}\cup \textsf {coNP}\), while global ones are at most in PSPACE. We also investigate universality (w.r.t. simulation) and we provide a constructive example of universal fDDS for the family of additive fDDS having a unique global attractor. The question of the complexity of deciding universality for a given family of fDDS is left open.Keywords(Finite) Discrete dynamical systemsComputational ComplexityUniversality
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
