11 |
Fuzzy Cellular Automata in Conjunctive Normal FormForrester, David M. 16 May 2011 (has links)
Cellular automata (CA) are discrete dynamical systems comprised of a lattice of finite-state cells. At each time step, each cell updates its state as a function of the previous state of itself and its neighbours.
Fuzzy cellular automata (FCA) are a real-valued extension of Boolean cellular automata which "fuzzifies" Boolean logic in the transition function using real values between zero and one (inclusive). To date, FCA have only been studied in disjunctive normal form (DNF).
In this thesis, we study FCA in conjunctive normal form (CNF). We classify FCA in CNF both analytically and empirically. We compare these classes to their DNF counterparts. We prove that certain FCA exhibit chaos in CNF, in contrast to the periodic behaviours of DNF FCA. We also briefly explore five different forms of fuzzy logic, and suggest further study. In support of this research, we introduce novel methods of simulating and visualizing FCA.
|
12 |
Fuzzy Cellular Automata in Conjunctive Normal FormForrester, David M. 16 May 2011 (has links)
Cellular automata (CA) are discrete dynamical systems comprised of a lattice of finite-state cells. At each time step, each cell updates its state as a function of the previous state of itself and its neighbours.
Fuzzy cellular automata (FCA) are a real-valued extension of Boolean cellular automata which "fuzzifies" Boolean logic in the transition function using real values between zero and one (inclusive). To date, FCA have only been studied in disjunctive normal form (DNF).
In this thesis, we study FCA in conjunctive normal form (CNF). We classify FCA in CNF both analytically and empirically. We compare these classes to their DNF counterparts. We prove that certain FCA exhibit chaos in CNF, in contrast to the periodic behaviours of DNF FCA. We also briefly explore five different forms of fuzzy logic, and suggest further study. In support of this research, we introduce novel methods of simulating and visualizing FCA.
|
13 |
Fuzzy Cellular Automata in Conjunctive Normal FormForrester, David M. January 2011 (has links)
Cellular automata (CA) are discrete dynamical systems comprised of a lattice of finite-state cells. At each time step, each cell updates its state as a function of the previous state of itself and its neighbours.
Fuzzy cellular automata (FCA) are a real-valued extension of Boolean cellular automata which "fuzzifies" Boolean logic in the transition function using real values between zero and one (inclusive). To date, FCA have only been studied in disjunctive normal form (DNF).
In this thesis, we study FCA in conjunctive normal form (CNF). We classify FCA in CNF both analytically and empirically. We compare these classes to their DNF counterparts. We prove that certain FCA exhibit chaos in CNF, in contrast to the periodic behaviours of DNF FCA. We also briefly explore five different forms of fuzzy logic, and suggest further study. In support of this research, we introduce novel methods of simulating and visualizing FCA.
|
14 |
Properties and Behaviours of Fuzzy Cellular AutomataBetel, Heather 14 May 2012 (has links)
Cellular automata are systems of interconnected cells which are discrete in space, time and state. Cell states are updated synchronously according to a local rule which is dependent upon the current state of the given cell and those of its neighbours in a pre-defined neighbourhood. The local rule is common to all cells. Fuzzy cellular automata extend this notion to systems which are discrete in space and time but not state. In this thesis, we explore fuzzy cellular automata which are created from the extension of Boolean rules in disjunctive normal form to continuous functions. Motivated by recent results on the classification of these rules from empirical evidence, we set out first to show that fuzzy cellular automata can shed some light on classical cellular automata and then to prove that the observed results are mathematically correct. The main results of this thesis can be divided into two categories. We first investigate the links between fuzzy cellular automata and their Boolean counter-parts. We prove that number conservation is preserved by this transformation. We further show that Boolean additive cellular automata have a definable property in their fuzzy form which we call self-oscillation. We then give a probabilistic interpretation of fuzzy cellular automata and show that homogeneous asymptotic states are equivalent to mean field approximations of Boolean cellular automata. We then turn our attention the asymptotic behaviour of fuzzy cellular automata. In the second half of the thesis we investigate the observed behaviours of the fuzzy cellular automata derived from balanced Boolean rules. We show that the empirical results of asymptotic behaviour are correct. In fuzzy form, the balanced rules can be categorized as one of three types: weighted average rules, self-averaging rules, and local majority rules. Each type is analyzed in a variety of ways using a range of tools to explain their behaviours.
|
15 |
Properties and Behaviours of Fuzzy Cellular AutomataBetel, Heather 14 May 2012 (has links)
Cellular automata are systems of interconnected cells which are discrete in space, time and state. Cell states are updated synchronously according to a local rule which is dependent upon the current state of the given cell and those of its neighbours in a pre-defined neighbourhood. The local rule is common to all cells. Fuzzy cellular automata extend this notion to systems which are discrete in space and time but not state. In this thesis, we explore fuzzy cellular automata which are created from the extension of Boolean rules in disjunctive normal form to continuous functions. Motivated by recent results on the classification of these rules from empirical evidence, we set out first to show that fuzzy cellular automata can shed some light on classical cellular automata and then to prove that the observed results are mathematically correct. The main results of this thesis can be divided into two categories. We first investigate the links between fuzzy cellular automata and their Boolean counter-parts. We prove that number conservation is preserved by this transformation. We further show that Boolean additive cellular automata have a definable property in their fuzzy form which we call self-oscillation. We then give a probabilistic interpretation of fuzzy cellular automata and show that homogeneous asymptotic states are equivalent to mean field approximations of Boolean cellular automata. We then turn our attention the asymptotic behaviour of fuzzy cellular automata. In the second half of the thesis we investigate the observed behaviours of the fuzzy cellular automata derived from balanced Boolean rules. We show that the empirical results of asymptotic behaviour are correct. In fuzzy form, the balanced rules can be categorized as one of three types: weighted average rules, self-averaging rules, and local majority rules. Each type is analyzed in a variety of ways using a range of tools to explain their behaviours.
|
16 |
Properties and Behaviours of Fuzzy Cellular AutomataBetel, Heather January 2012 (has links)
Cellular automata are systems of interconnected cells which are discrete in space, time and state. Cell states are updated synchronously according to a local rule which is dependent upon the current state of the given cell and those of its neighbours in a pre-defined neighbourhood. The local rule is common to all cells. Fuzzy cellular automata extend this notion to systems which are discrete in space and time but not state. In this thesis, we explore fuzzy cellular automata which are created from the extension of Boolean rules in disjunctive normal form to continuous functions. Motivated by recent results on the classification of these rules from empirical evidence, we set out first to show that fuzzy cellular automata can shed some light on classical cellular automata and then to prove that the observed results are mathematically correct. The main results of this thesis can be divided into two categories. We first investigate the links between fuzzy cellular automata and their Boolean counter-parts. We prove that number conservation is preserved by this transformation. We further show that Boolean additive cellular automata have a definable property in their fuzzy form which we call self-oscillation. We then give a probabilistic interpretation of fuzzy cellular automata and show that homogeneous asymptotic states are equivalent to mean field approximations of Boolean cellular automata. We then turn our attention the asymptotic behaviour of fuzzy cellular automata. In the second half of the thesis we investigate the observed behaviours of the fuzzy cellular automata derived from balanced Boolean rules. We show that the empirical results of asymptotic behaviour are correct. In fuzzy form, the balanced rules can be categorized as one of three types: weighted average rules, self-averaging rules, and local majority rules. Each type is analyzed in a variety of ways using a range of tools to explain their behaviours.
|
17 |
From form generators to automated diagrams: using cellular automata to support architectural designHerr, Christiane Margerita. January 2008 (has links)
published_or_final_version / Architecture / Doctoral / Doctor of Philosophy
|
18 |
Identification and analysis of a class of spatio-temporal systemsYang, Ying-Xu January 2000 (has links)
No description available.
|
19 |
Complexity Properties of the Cellular Automaton Game of LifeRechtsteiner, Andreas 14 November 1995 (has links)
The Game of life is probably the most famous cellular automaton. Life shows all the characteristics of Wolfram's complex Class N cellular automata: long-lived transients, static and propagating local structures, and the ability to support universal computation. We examine in this thesis questions about the geometry and criticality of Life. We find that Life has two different regimes with different dimensionalities. In the small scale regime Life shows a fractal dimensionality with Ds = 0.658 and in the large scale regime D1 = 2.0, suggesting that the objects of Life are randomly distributed. We find that Life differentiates between different spatial directions in the universe. This is surprising because Life's transition rules do not show such a differentiation. We find further that the correlations between alive cells extend farthest in the active period and that they decrease in the glider period, suggesting that Life is sub-critical. Finally, we find a size-distribution of active clusters which does not depend on the lattice size and amount of activity, except for the largest clusters. We suggest that this result also indicates that Life is sub-critical.
|
20 |
New bounds for the distributed firing synchronization problem /Settle, Tanya Amber January 1999 (has links)
Thesis (Ph. D.)--University of Chicago, Dept. of Computer Science, March 1999. / Includes bibliographical references. Also available on the Internet.
|
Page generated in 0.5304 seconds