International Journal of General Systems

ISSN: (Print) (Online) Journal homepage: https://www.tandfonline.com/loi/ggen20

Fractional logistic map with fixed memory length

S. E. I. Bouzeraa, R. Bououden & M. S. Abdelouahab

To cite this article: S. E. I. Bouzeraa, R. Bououden & M. S. Abdelouahab (2023): Fractional

logistic map with fixed memory length, International Journal of General Systems, DOI:
10.1080/03081079.2023.2201001

To link to this article: https://doi.org/10.1080/03081079.2023.2201001

Published online: 25 Apr 2023.

Submit your article to this journal

View related articles

View Crossmark data

Full Terms & Conditions of access and use can be found at

https://www.tandfonline.com/action/journalInformation?journalCode=ggen20
INTERNATIONAL JOURNAL OF GENERAL SYSTEMS
https://doi.org/10.1080/03081079.2023.2201001

Fractional logistic map with fixed memory length

S. E. I. Bouzeraaa,b , R. Bououdenc and M. S. Abdelouahab c

a Laboratory of Applied Mathematics and Didactics, Ecole Normale Supérieure de Constantine, Constantine,

Algeria; b Department of Mathematics and Computer science, Abdelhafid Boussouf University Center of Mila,
Mila, Algeria; c Laboratory of Mathematics and their Interactions, Abdelhafid Boussouf University Center of
Mila, Mila, Algeria

ABSTRACT ARTICLE HISTORY

This paper investigates the discrete fractional-order logistic map and Received 25 July 2022
reports its fractional order with a fixed memory length version. The Accepted 4 April 2023
dynamic of the proposed system is analyzed using the bifurcation KEYWORDS
diagram and the recently introduced 0–1 test. It is shown that this Logistic map; bifurcation;
fractional order with a fixed memory length logistic map can exhibit fixed memory length;
rich nonlinear dynamics such as period-doubling bifurcation and fractional order
chaos. Furthermore, it does not require significant time to perform
the calculations.

1. Introduction
The chaotic behavior is one important aspect of dynamic systems. Much attention has
been paid to the topic on discrete dynamic since the 1970’s (May and Robert 1976;
Hénon 1976; Lozi 1978; Zeraoulia 2005; Gottwald and Melbourne 2009; Bououden and
Abdelouahab 2021). Chaos has great potential use in many technological disciplines like
physics, mechanics, electronics, biology, economy, astronomy, meteorology, optimiza-
tion,. . . etc. (Zhong and Ayrom 1985; Bischi, Gardini, and Kopel 2000; Agiza, Hegazi, and
Elsadany 2001; Illing 2009; Lin, Wong, and Chen 2013; Abdelouahab and Hamri 2014;
Bououden and Abdelouahab 2018, 2020; Benkouider et al. 2020; Bououden et al. 2021;
Benkouider et al. 2021; Boudjerida, Abdelouahab, and Lozi 2022, 2023).
Fractional Calculus can be traced back to the development of classical calculus itself,
but its development in the primary stage was slow due to the lack of geometric interpre-
tations and applications. Up until recent decades, researchers have noted that fractional
calculus has superior characteristics to classical one. Nowadays, with the rapid develop-
ment of numerical algorithms fractional calculus becomes the subject of intense theoretical
research and practical applications (Miller and Ross 1989), and researchers have paid great
attention to fractional discrete calculus (Ferhan and Paul 2007; Abdeljawad 2011; Chen,
Luo, and Zhou 2011), especially fractional-order chaotic maps due to its potential appli-
cations in various engineering fields, because discrete fractional-order maps are sensitive
not only to small perturbations in parameters and initial conditions, but also to fractional-
order variations, which is their main advantage (Guo-Chang and Dumitru 2014; Hu 2014;

CONTACT R. Bououden [email protected]

© 2023 Informa UK Limited, trading as Taylor & Francis Group

2 S. E. I. BOUZERAA ET AL.

Shukla and Sharma 2017; Khennaoui et al. 2019; Jouini et al. 2019; Bououden, Abde-
louahab, and Jarad 2021). The nonexistence of non-constant exact periodic solutions for
fractional-order systems was initially reported (Tavazoei and Haeri 2009; Tavazoei 2010),
this property limits the applicability of fractional order systems for modeling certain real
phenomenon knowing to have periodicity, on the other hand, long memory makes numer-
ical computation very expensive in terms of time. A modified fractional order derivative
(called fractional-order derivative with fixed memory length) was proposed to overcome
this issue (Abdelouahab and Hamri 2016; Bourafa, Abdelouahab, and Lozi 2021). It has
been demonstrated that the proposed derivative preserves periodicity and is numerically
inexpensive. this modification is justified by the fact that the memory term for many mod-
els in real-world applications is short. For example, primary or active memory, which
stores a small amount of information in the mind and makes it readily available for a
limited period, can hold only seven items at once, plus or minus two (Miller 1956) and
most stored information will be lost within approximately 20 to 30 seconds (Atkinson and
Shiffrin 1971). Another example is archiving period, where documents are generally kept : 7
years for financial documents, 10 years after the date of death of the patient for medical
records, 3 years after the end of termination of employment for personnel records, and 5
years after closing a case for case files Law (Archive-it 2023). Like continuous fractional-
order systems, discrete fractional-order systems also face delicate periodicity issues and
numerical cost (Diblík, Feŏkan, and Pospisil 2015; Jonnalagadda 2020; Feŏkan 2020;
Pospís̆il 2021).
For these reasons, we propose a map with a fixed memory length. For these reasons, we
propose and analyze in this paper the fractional logistic map with fixed memory length. In
the next section, we introduce the basic definitions and the preliminaries of discrete frac-
tional calculus. In Section 3, we propose and analyze the fractional logistic maps, which are
analyzed by means of bifurcations diagrams. In Section 4, to distinguish between chaotic
and regular behavior of the fractional logistic map with fixed memory length, we use the
0–1 test method. Finally, conclusions are shown in the last section.

2. Fractional discrete-time calculus

This section is devoted to some necessary definitions from the discrete fractional calculus.
Let d ∈ R fixed and let Nd = {d, d + 1, d + 2, . . .} denotes the isolated time scale (Fer-
han and Paul 2007). For the function u(n), the delta difference operator  is defined
as

u(n) = u(n + 1) − u(n). (1)

Definition 2.1 (Miller and Ross (1989)): Let u : Nd −→ R and v > 0. Then, the fractional
sum of v order is defined by

1 
t−v
−v
d u(t) = (t − σ (s))(v−1) u(s), t ∈ Nd+v , (2)
(v)
s=d
 INTERNATIONAL JOURNAL OF GENERAL SYSTEMS 3

Figure 1. Bifurcation diagram of Logistic map with 2.5 < a ≤ 4.

where d is the starting point, σ (s) = s + 1 and t (v) is the falling function defined in terms
of the Gamma function as
(t + 1)
t (v) = . (3)
(t + 1 − v)

/ N and u(t) defined on Nd , the

Definition 2.2 (Abdeljawad (2011)): For v > 0, v ∈
Caputo-like delta difference is defined by

c
vd u(t) = d−(m−v) m u(t) (4)

1 
t−(m−v)
= (t − σ (s))(m−v−1) m
s u(s), (5)
(m − v)
s=d

where t ∈ Nd+m−v , m = [v] + 1.

Theorem 2.1 (Chen, Luo, and Zhou (2011).): For the delta fractional difference equation
 c v u(t)
d = f (t + v − 1, u(t + v − 1))
 u(d) = u
k
k , m = [v] + 1, k = 0, . . . , m − 1,

the equivalent discrete integral equation can be obtained as

1 
t−v
u(t) = ud (t) + (t − σ (s))(v−1) × f (s + v − 1, u(s + v − 1)), t ∈ Nd+m ,
(v)
s=d+m−v
(6)
where

m−1
(t − d)(k) k
ud (t) =  u(d). (7)
k!
k=0

3. Fractional logistic map with fixed memory length

The classical logistic map is defined as

xn+1 = axn (1 − xn ), (8)

which exhibits chaos behaviors for most values of a between 3.57 and 4 as in Figure 1.
4 S. E. I. BOUZERAA ET AL.

The first order difference of (8) can be easily formulated as:

xn = xn+1 − xn
= axn (1 − xn ) − xn , (9)

Using the Caputo-like delta difference with d as the starting point, the fractional-order
difference of (9) is given by
c
vd x(t) = ax(t − 1 + v)(1 − x(t − 1 + v)) − x(t − 1 + v), (10)

where a is the bifurcation parameter and v is the fractional order.

For 0 < v ≤ 1 and t ∈ Nd+1−v . Following Theorem 2.1, using the discrete kernel
function (11):
(t − s)
(t − σ (s))v−1 = , (11)
(t − s − v + 1)
and assuming that d = 0, the numerical formulas for the fractional map (10) may be
obtained as:

1  (n − j + v)
n
xn = x0 + (axj−1 (1 − xj−1 ) − xj−1 ). (12)
(v) j=1 (n − j + 1)

For v = 1, the discrete fractional map (12) can be reduced to the classical one (8).
Compared with the map of the integer order (8), the fractional one (12) has a discrete
kernel function. xn depends on the past information x0 , x1 , . . . , xn−1 . As a result, the mem-
ory effects of the discrete maps mean that their present state of evolution depends on all
past states (Guo-Chang and Dumitru 2014). Figure 2 presents different behaviors of the
trajectories of the map (12) for different values of v. When v = 1, we obtain the bifurcation
diagram as in Figure 1 (Guo-Chang and Dumitru 2014).
For the reason mentioned in section 1 we propose the fractional logistic map with fixed
memory length as follow

1  (n − j + v)
n
xn = x0 + (axj−1 (1 − xj−1 ) − xj−1 ) if nM
(v) j=1 (n − j + 1)
(13)
1 n
(n − j + v)
xn = x0 + (axj−1 (1 − xj−1 ) − xj−1 ) else,
(v) j=n−M−1 (n − j + 1)

where M is the length of the fixed memory.

Assume v = 0.3, x(0) = 0.3 and n = 5000. We can derive the numerical solutions
x(n) for different values of a. In that follows Figures 3(a,b,c) and (d) show the numerical
solutions of (13) for different values of a.
In order to understand more about the behavior of fractional map (13), we employ
bifurcation diagrams for different values of v as in Figure 4. For example if v = 0.3 and
2.25 < a < 3.6 we can see different bifurcations as shown in Figure 4 (a). In the interval
2.25 < a < 2.43, map (13) converges to a stable fixed point. The first bifurcation occurs at
a = 2.43 from fixed point to a period-2 orbit (period-doubling bifurcation); and along
 INTERNATIONAL JOURNAL OF GENERAL SYSTEMS 5

Figure 2. Bifurcation diagram of fractional logistic map (12) for different values of v, (a) v = 0.6 and (b)
v = 0.2.

Figure 3. Solutions of fractional logistic map with fixed memory length for v = 0.3 and for different
values of a, (a) a = 2.2, (b) a = 2.6, (c) a = 3.1 and (d) a = 3.5.

the interval 2.43 ≤ a < 3.06 it converges to a stable cycle of period-2. When a = 3.06,
the second bifurcation occurs from the cycle of period-2 to a stable cycle of period-4
(Period-doubling bifurcation). Then follows a series of bifurcation of the type period-
doubling bifurcation until a = 3.2 when the chaotic behavior appears. When 3.2 < a < 3.6,
the map (13) is chaotic.
In this following, we will study the effect of the memory length M on behavior of
the map, we will choose two values for the memory of length M and then plot the
corresponding bifurcation diagrams.
From the Figure 5, we notice that the logistic map with fixed memory length for
M = 100 remains stable for 2.2 < a < 2.43 while the map for M = 200 is stable when
6 S. E. I. BOUZERAA ET AL.

Figure 4. Bifurcation diagram of fractional logistic map with fixed memory length for length M = 100
for different values of v, (a) v = 0.3 and (b) v = 0.5.

Figure 5. Bifurcation diagram of fractional logistic map with fixed memory length for different values
of M, (a) for M = 100 and (b) for M = 200.

2.2 < a < 2.4. From the figure, we observe that the logistic map with fixed memory length
for M = 100 remains chaotic for 3.2 < a < 3.6. The map for M = 200 shows chaotic
behavior when 3.18 < a < 3.58. We conclude that as we change the length M, the regimes
bifurcation diagrams represented in Figure 5 are changed.
To prove the validity of our claim in the section 1 we provide the following Table 1 that
presents the time taken to obtain the trajectory of fractional logistic map and that taken to
obtain the trajectory of fractional logistic map with fixed memory length.
Each program was implemented in Matlab (MathWorks) and all the programs were run
on a 2.53 GHz, i3 processor with 4 GB of random access memory.
The Table 1 shows that the preference is given to the fractional logistic map with fixed
memory length and this is due to the large difference between the time taken to obtain its
trajectory and that taken to obtain the trajectory of fractional logistic map.
 INTERNATIONAL JOURNAL OF GENERAL SYSTEMS 7

Table 1. The time taken to obtain the trajectory of the fractional

logistic map (FLM) and the fractional logistic map with fixed memory
length (FLMFML) when M = 100.
Number of iteration FLM FLMFML
3000 102.072112 1.266282
5000 464.216451 1.897441
8000 1891.570038 2.904257
10, 000 3479.90049 3.521526
20, 000 8596.452361 6.568458

4. Chaos of fractional logistic map with fixed memory length

In this section, we use the 0−1 test method to prove the existence of chaotic behavior
in a deterministic nonlinear system. This method was introduced in 2003 by Gattwald
and Melbourne. The advantage of 0–1 test is that it does not need the phase recon-
struction, therefore it is applied on a time series directly. To use the method we choose
φ(xj ) = xj , for j = 1, 2, . . . , N., and also we choose a constant c at random between π2 and
π . From the time series x(n)n=1,...,N , the terms pc and qc can be defined for n = 1, . . . , N as
pc (n) = nj=1 x(j) cos(jc) and qc (n) = nj=1 x(j) sin(jc), then we plot trajectories pc and
qc to determine the dynamics of the system. If the behavior of trajectories pc and qc are
Brownian motion, then the tested dynamical system is chaotic, while the system is regu-
lar (periodic or quasi-periodic) when the dynamics of the trajectories pc and qc in plane
(pc − qc ) are bounded. The mean square displacement Mc of two varaibles pc and qc is
given by

1 
N
Mc (n) = (pc (j + n) − pc (j))2 + (qc (j + n) − qc (j))2 . (14)
N j=1

Finally, using the correlation method, we calculate the asymptotic growth rate k, which is
defined by the median value of correlation coefficient kc (k = median(kc )) where
cov(ξ , χ )
kc = √ ∈ [−1, 1], (15)
var(ξ )var(χ )
where ξ = (1, 2, . . . , ncut ), χ = (Dc (1), Dc (2), . . . , Dc (cut)), ncut = round(N/10)), and
Dc (n) is the modified mean square displacement, can be defined by
1 − cos(nc)
Dc (n) = Mc (n) − (E(φ(xj )))2 , (16)
1 − cos(c)
where the mean E(φ) is given by

1 
N
E(φ(xj )) = lim φ(xj ). (17)
N→+∞ N
j=1

Hence the system is chaotic when k approaches 1, while it becomes periodic or quasi-
periodic (regular dynamics) when k approaches 0.
The results of 0–1 test of the fractional logistic map with fixed memory length when
fractional-order v = 0.5 and the memory length M = 100 are presented in Figure 6.
8 S. E. I. BOUZERAA ET AL.

Figure 6. (pc , qc ) plot of the fractional logistic map with fixed memory length when M = 100 and
v = 0.5: (a) a = 3.3 and (b) a = 2.2.

Figure 7. Asymptotic growth rate k versus c of the fractional logistic map with fixed memory length
when M = 100 and v = 0.5: (a) a = 3.3 and (b) a = 2.2.

Where we see the trajectories of pc and qc in plane (pc − qc ) for tow different values of
bifurcation parameter a. When a = 3.3, the behavior of trajectory in the (pc − qc ) space
is like Brownian motion, this means that the fractional logistic map with fixed memory
length has chaotic behavior (see Figure 6(a)), whereas when a = 2.2 the trajectory in the
(pc − qc ) space is bounded, it means that the map is not chaotic (regular) (see Figure 6(b)).
In Figure 7, we plot the asymptotic growth rate k versus c. When a = 3.3, we see that the
asymptotic growth rate k equals 0.9975, it is close to 1, this means that the fractional logis-
tic map with fixed memory length is chaotic (see Figure 7(a)), while when a = 2.2 the
asymptotic growth rate k equals −0.025, it is close to 0, implies the map is regular (see
Figure 7(b)).
 INTERNATIONAL JOURNAL OF GENERAL SYSTEMS 9

Table 2. The results of 0–1 test of the fractional logistic map

with fixed memory length when M = 100 and v = 0.5.
Bifurcation Dynamic of Asymptotic Dynamic
parameter pc and qc growth rate of map
a = 3.3 Brownian-like k = 0.9975 Chaotic
a = 2.2 Bounded k = −0.025 Regular

The Table 2 summarizes the results obtained above.

5. Conclusions
This paper reported the results of a study of the discrete fractional logistic map with fixed
memory length using the delta difference of fractional order. The main difference between
it and the discrete fractional logistic map is that it has a fixed memory length and this
is what makes it more practical. The dynamic of the discrete fractional logistic map with
fixed memory length is analyzed by means of bifurcations diagram. Based on the obtained
results, we see that the dynamic of the discrete fractional logistic map with fixed memory
length depends on the coefficient a, the difference order v and the length of the memory M.
We also concluded that the fixed memory length enables us to perform calculations more
quickly and calculate more iteration numbers, and it is more practical in that it does not
require a long memory.

Disclosure statement
No potential conflict of interest was reported by the author(s).

ORCID
M. S. Abdelouahab http://orcid.org/0000-0002-9235-8362

References
Abdeljawad, T. 2011. “On Riemann and Caputo Fractional Differences.” Computers & Mathematics
with Applications 62 (3): 1602–1611. doi:10.1016/j.camwa.2011.03.036.
Abdelouahab, M. S., and N. Hamri. 2014. “Fractional-Order Hybrid Optical System and Its Chaos
Control Synchronization.” Electronic Journal of Thoretical Physics 11 (30): 49–62.
Abdelouahab, M. S., and N. Hamri. 2016. “The Grünwald–Letnikov Fractional-Order Deriva-
tive with Fixed Memory Length.” Mediterranean Journal of Mathematics 13 (2): 557–572.
doi:10.1007/s00009-015-0525-3.
Agiza, H. N., A. S. Hegazi, and A. A. Elsadany. 2001. “The Dynamics of Bowley’s Model With
Bounded Rationality.” Chaos, Solitons and Fractals 12 (9): 1705–1717. doi:10.1016/S0960-0779
(00)00021-7.
Archive-it, 2023. “How Long Should Documents Be Kept?” https://www.archive-it.eu/retention-
period-of-documents.
Atkinson, R. C., and R. M. Shiffrin. 1971. “The Control Processes of Short-Term Memory”. Institute
for Mathematical Studies in the Social Sciences, Stanford University.
Benkouider, K., T. Bouden, A. Sambas, M. A. Mohamed, I. M. Sulaiman, M. Mamat, and M. A.
H. Ibrahim. 2021. “Dynamics, Control and Secure Transmission Electronic Circuit Implemen-
tation of a New 3D Chaotic System in Comparison With 50 Reported Systems.” IEEE Access 9:
152150–152168. doi:10.1109/ACCESS.2021.3126655.
10 S. E. I. BOUZERAA ET AL.

Benkouider, K., T. Bouden, M. E. Yalcin, and S. Vaidyanathan. 2020. “A New Family of 5D, 6D, 7D
and 8D Hyperchaotic Systems From the 4D Hyperchaotic Vaidyanathan System, the Dynamic
Analysis of the 8D Hyperchaotic System with Six Positive Lyapunov Exponents and An Appli-
cation to Secure Communication Design.” International Journal of Modelling, Indentification and
Control 35 (3): 241–257. doi:10.1504/IJMIC.2020.114191.
Bischi, G. I., L. Gardini, and M. Kopel. 2000. “Analysis of Global Bifurcations in a Mar-
ket Share Attraction Model.” Journal of Economic Dynamics and Control 24 (5-7): 855–879.
doi:10.1016/S0165-1889(99)00028-7.
Boudjerida, N., M. S. Abdelouahab, and R. Lozi. 2022. “Modified Projective Synchronization of
Fractional-Order Hyperchaotic Memristor-Based Chua’s Circuit.” Journal of Innovative Applied
Mathematics and Computational Sciences 2 (3): 69–85. doi:10.58205/jiamcs.v2i3.
Boudjerida, N., M. S. Abdelouahab, and R. Lozi. 2023. “Nonlinear Dynamics and Hyperchaos in
a Modified Memristor-Based Chua’s Circuit and Its Generalized Discrete System.” Journal of
Difference Equations and Applications 1–22. doi:10.1080/10236198.2023.2172334.
Bououden, R., and M. S. Abdelouahab. 2018. “On Efficient Chaotic Optimization Algorithm Based
On Partition of Data Set in Global Research Step.” Nonlinear Dynamics and Systems Theory 18
(1): 42–52.
Bououden, R., and M. S. Abdelouahab. 2020. “Chaos In New 2-d Discrete Mapping and Its
Application In Optimisation.” Nonlinear Dynamics and Systems Theory 20 (2): 144–152.
Bououden, R., and M. S. Abdelouahab. 2021. “Chaotic Optimization Algorithm Based On The Mod-
ified Probability Density Function of Lozi Map.” Boletim Da Sociedade Paranaense De Matematica
39 (6): 9–22. doi:10.5269/2175-1188.
Bououden, R., M. S. Abdelouahab, and F. Jarad. 2021. “Non-Linear Dynamics and Chaos in a New 2-
D Piecewise Linear Map and Its Fractional Version.” Electronic Research Archive 28 (1): 505–525.
doi:10.3934/era.2020041.
Bououden, R., M. S. Abdelouahab, F. Jarad, and Z. Hammouch. 2021. “A Novel Fractional Piecewise
Linear Map: Regular and Chaotic Dynamics.” International Journal of General Systems 50 (5):
501–526. doi:10.1080/03081079.2021.1919102.
Bourafa, S., M. S. Abdelouahab, and R. Lozi. 2021. “On Periodic Solutions of Fractional-Order
Differential Systems with a Fixed Length of Sliding Memory.” Journal of Innovative Applied
Mathematics and Computational Sciences 1 (1): 64–78. doi:10.58205/jiamcs.v1i1.
Chen, F. L., X. N. Luo, and Y. Zhou. 2011. “Existence Results For Nonlinear Fractional Difference
Equation.” Advances in Difference Equations 2011. doi:10.1155/2011/713201..
Diblík, J., M. Feŏkan, and M. Pospisil. 2015. “Nonexistence of Periodic Solutions and S-
Asymptotically Periodic Solutions in Fractional Difference Equations.” Applied Mathematics and
Computation 257: 230–240. doi:10.1016/j.amc.2014.11.108.
Feŏkan, M. 2020. “Note on Periodic and Asymptotically Periodic Solutions of Fractional Differential
Equations.” Studies in Systems, Decision and Control 177: 153–185. doi:10.1007/978-3-319-99918-0.
Ferhan, M. A., and W. E. Paul. 2007. “Initial Value Problems In Discrete Fractional Calculus.”
International Journal of Difference Equations 137 (3): 165–176.
Gottwald, G. A., and I. Melbourne. 2009. “On The Implementation of The 0-1 Test For Chaos.” SIAM
Journal Applied Dynamical Systems 8 (1): 129–145. doi:10.1137/080718851.
Guo-Chang, W., and B. Dumitru. 2014. “Discrete Fractional Logistic Map and Its Chaos.” Nonlinear
Dynamics 75 (1–2): 283–287. doi:10.1007/s11071-013-1065-7.
Hénon, M. 1976. “A Two Dimensional Mapping with a Strange Attractor.” Communications in
Mathematical Physics 50 (1): 69–77. doi:10.1007/BF01608556.
Hu, T. 2014. “Discrete Chaos in Fractional Henon Map.” Applied Mathematics 05 (15): 2243–2248.
doi:10.4236/am.2014.515218.
Illing, L. 2009. “Digital Communication Using Chaos and Non Linear Dynamics.” Nonlinear
Analysis 71 (12): e2958–e2964. doi:10.1016/j.na.2009.07.007.
Jonnalagadda, J. 2020. “Periodic Solutions of Fractional Nabla Difference Equations.” Communica-
tions in Applied Analysis 20: 585–610. doi:10.12732/caa.v20i4.8.
 INTERNATIONAL JOURNAL OF GENERAL SYSTEMS 11

Jouini, L., A. Ouannas, A. A. Khennaoui, X. Wang, G. Grassi, and V. T. Pham. 2019. “The Fractional
Form of a New Three-Dimensional Generalized Hénon Map.” Advances in Difference Equations
51: 1–12. doi:10.1186/s13662-019-2064-x.
Khennaoui, A. A., A. Ouannas, S. Bendoukha, G. Grassi, R. P. Lozi, and V. T. Pham. 2019. “On Frac-
tional–order Discrete–time Systems: Chaos, Stabilization and Synchronization.” Chaos, Solitons
and Fractals 119: 150–162. doi:10.1016/j.chaos.2018.12.019.
Lin, Q., K. W. Wong, and J. Chen. 2013. “An Enhanced Variable-Length Arithmetic Coding
and Encryption Scheme Using Chaotic Maps.” Journal of Systems Software 86 (5): 1384–1389.
doi:10.1016/j.jss.2013.01.012.
Lozi, R. 1978. “Un Attracteur Etrange Du Type Attracteur De Hénon.” Journal De Physique 39 (C5):
9–10. doi:10.1051/jphyscol:1978505.
May, R., and M. Robert. 1976. “Simple Mathematical Models with Very Complicated Dynamics.”
Nature 261 (5560): 459–467. doi:10.1038/261459a0.
Miller, G. A. 1956. “The Magical Number Seven Plus Or Minus Two: Some Limits on Our Capacity
for Processing Information.” Psychological Review 63 (2): 81–97. doi:10.1037/h0043158.
Miller, K. S., and B. Ross. 1989. “ Fractional Difference Calculus.” In Proceedings of the Interna-
tional Symposium on Univalent Functions, Fractional Calculus and Their Applications, 139–152.
Koriyama, Japan: Nihon University.
Pospís̆il, M. 2021. “Note on Fractional Difference Equations with Periodic and S-Asymptotically
Periodic Right-Hand Side.” Nonlinear Oscillation 24: 99–109.
Shukla, M. K., and B. B. Sharma. 2017. “Investigation of Chaos in Fractional Order Gener-
alized Hyperchaotic Henon Map.” International Journal Electronic Commerce 78: 265–273.
doi:10.1016/j.aeue.2017.05.009.
Tavazoei, M. 2010. “A Note on Fractional-Order Derivatives of Periodic Functions.” Automatica 46
(5): 945–948. doi:10.1016/j.automatica.2010.02.023.
Tavazoei, M., and M. A. Haeri. 2009. “Proof for Non-Existence of Periodic Solutions in Time Invari-
ant Fractional Order Systems.” Automatica 45 (8): 1886–1890. doi:10.1016/j.automatica.2009.
04.001.
Zeraoulia, E. 2005. “A New Chaotic Attractor From 2-D Discrete Mapping Via Border-collision
Period Doubling Scenario.” Discrete Dynamics in Nature and Society 2005 (3): 235–238. doi:10.
1155/DDNS.2005.235.
Zhong, G. Q., and F. Ayrom. 1985. “Experimental Confirmation of Chaos From Chua’s Circuit.”
International Journal of Circuit Theory and Applications 13 (1): 93–98. doi:10.1002/(ISSN)1097-
007X.