The dynamics of general fuzzy cellular automata

5Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We continue the investigation into the dynamics and evolution of fuzzy rules, obtained by the fuzzification of the disjunctive normal form, and initiated for rule 90 in [2], for rule 110 in [10] and for rule 30 in [3]. We present general methods for detecting the evolution and dynamics of any one of the 255 fuzzy rules and apply this theory to fuzzy rules 30, 110, 18, 45, and 184, each of which has a Boolean counterpart with interesting features. Finally, it is deduced that (except for at most nine cases) no fuzzy cellular automaton admits chaotic behavior in the sense that no sensitive dependence on the initial string can occur. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Mingarelli, A. B. (2005). The dynamics of general fuzzy cellular automata. In Lecture Notes in Computer Science (Vol. 3515, pp. 351–359). Springer Verlag. https://doi.org/10.1007/11428848_47

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free