We apply the two different definitions of chaos given by Devaney and by Knudsen for general discrete time dynamical systems (DTDS) to the case of 1-dimensional cellular automata. A DTDS is chaotic according to the Devaney’s definition of chaos iff it is topologically transitive, has dense periodic orbits, and it is sensitive to initial conditions. A DTDS is chaotic according to the Knudsen’s de...

This paper examines the chaotic properties of the elementary cellular automaton rule 40. Rule 40 has been classified into Wolfram’s class I and also into class 1 by G. Braga et al. These classifications mean that the time-space patterns generated by this cellular automaton die out in a finite time and so are not interesting. As such, we may hardly realize that rule 40 has chaotic properties. In...

These are some notes related to the one-semester course Math 5535 Dynamical Systems and Chaos given at the University of Minnesota during Fall 2012 with an emphasis to the study of continuous and discrete dynamical systems of dimension one and two. An ambitious list of topics to be covered include phase portraits, fixed points, stability, bifurcations, limit sets, periodic orbit, Poincaré map a...

Our goal in these notes is to understand the long-time behavior of solutions to ODEs. For this it will be very useful to introduce the notion of ω-limit sets. A remarkable result the Poincaré–Bendixson theorem is that for planar ODEs, one can have a rather good understanding of ω-limit sets. I have been benefited a lot from the textbook Differential equations, dynamical systems and an introduct...

Wolfram divided the 256 elementary cellular automata rules informally into four classes using dynamical concepts like periodicity, stability, and chaos. Rule 14, which is Bernoulli στ -shift rule and is a member of Wolfram’s class II, is said to be simple as periodic before. Therefore, it is worthwhile studying dynamical behaviors of rule 14, whether it possesses chaotic attractors or not. In t...

Barnsley (2006) used chaos game in function systems and it gave rise to interesting fractals by combining it with function iterations. A fractal fern is generated by taking different probabilities in the chaos game. In this paper, we introduce two advanced iterations from nonlinear analysis into the study of IFS for generation and pattern recognition of new fractal ferns. Gottfried (1991), and ...

Abstract We provide a complete characterization of the possible sets periods for Devaney chaotic linear operators on Hilbert spaces. As consequence, we also derive this linearizable maps Banach

We study when the operator f(Bw) is chaotic in the sense of Devaney on a Köthe echelon sequence space, where Bw is a weighted backward shift and f(z) = ∑∞ j=0 fjz j is a formal power series.