Time complexity of algorithms of full analysis of dynamical systems with discrete time, defined on a finite set of states

V.I. Ruban (Oles Honchar Dnipropetrovsk National University)
A.A. Rudenko (Oles Honchar Dnipropetrovsk National University)

Abstract


For discrete dynamical systems with a finite number of states, we obtain order of time complexity ascension of algorithms of their full analysis.

Keywords


time complexity; algorithm; dynamical system

References


Cristian C. Theories of computational complexity, North Holland, Amsterdam, 1987; 487 p.

Sipser M. Introduction to the theory of computation, Thomson Course Technology, Boston, 1996; 431 p.

Sharkovskij A.N. "Coexistence of cycles of continuous mappings of the real line into itself", Ukrainian Math. J., 1964; 1: pp. 865-868. (in Russian)




DOI: https://dx.doi.org/10.15421/241615

  

Refbacks

  • There are currently no refbacks.


Copyright (c) 2016 V.I. Ruban, A.A. Rudenko

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.


Registered in


ISSN (Online): 2664-5009
ISSN (Print): 2664-4991
DNU