Log in

Relevant bibliographies by topics / Cellular automata / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Cellular automata.

Dissertations / Theses on the topic 'Cellular automata'

Author: Grafiati

Published: 4 June 2021

Last updated: 25 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'Cellular automata.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Collins, Sean. "Interactive cellular automata." Thesis, Lancaster University, 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.435877.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Epperlein, Jeremias. "Topological Conjugacies Between Cellular Automata." Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2017. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-231823.

Full text

Abstract:

We study cellular automata as discrete dynamical systems and in particular investigate under which conditions two cellular automata are topologically conjugate. Based on work of McKinsey, Tarski, Pierce and Head we introduce derivative algebras to study the topological structure of sofic shifts in dimension one. This allows us to classify periodic cellular automata on sofic shifts up to topological conjugacy based on the structure of their periodic points. We also get new conjugacy invariants in the general case. Based on a construction by Hanf and Halmos, we construct a pair of non-homeomorp

APA, Harvard, Vancouver, ISO, and other styles

3

Rakotomalala, Livaniaina Hary. "Network Decontamination Using Cellular Automata." Thesis, Université d'Ottawa / University of Ottawa, 2016. http://hdl.handle.net/10393/34095.

Full text

Abstract:

We consider the problem of decontaminating a network where all nodes are infected by a virus. The decontamination strategy is performed using a Cellular Automata (CA) model in which each node of the network is represented by the automata cell and thus, the network host status is also mapped to the CA state (contaminated, decontaminating, decontaminated). All hosts are assumed to be initially contaminated and the status of each cell is synchronously updated according to a set of local rules, based on the state of its neighbourhood. Our goal is to find the set of local rules that will accomplis

APA, Harvard, Vancouver, ISO, and other styles

4

Weimar, Jorg Richard. "Cellular automata for reactive systems." Doctoral thesis, Universite Libre de Bruxelles, 1995. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/212557.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Deng, Mingyuan. "Programmable cellular automata for cryptosystems." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp01/MQ39137.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Serquera, Jaime. "Sound synthesis with cellular automata." Thesis, University of Plymouth, 2012. http://hdl.handle.net/10026.1/1189.

Full text

Abstract:

This thesis reports on new music technology research which investigates the use of cellular automata (CA) for the digital synthesis of dynamic sounds. The research addresses the problem of the sound design limitations of synthesis techniques based on CA. These limitations fundamentally stem from the unpredictable and autonomous nature of these computational models. Therefore, the aim of this thesis is to develop a sound synthesis technique based on CA capable of allowing a sound design process. A critical analysis of previous research in this area will be presented in order to justify that thi

APA, Harvard, Vancouver, ISO, and other styles

7

Powley, Edward Jack. "Global properties of cellular automata." Thesis, University of York, 2009. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.516655.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Clewlow, Les. "Cellular automata and dynamical systems." Thesis, University of Warwick, 1989. http://wrap.warwick.ac.uk/4233/.

Full text

Abstract:

In this thesis we investigate the theoretical nature of the mathematical structures termed cellular automata. Chapter 1: Reviews the origin and history of cellular automata in order to place the current work into context. Chapter 2: Develops a cellular automata framework which contains the main aspects of cellular automata structure which have appeared in the literature. We present a scheme for specifying the cellular automata rules for this general model and present six examples of cellular automata within the model. Chapter 3: Here we develop a statistical mechanical model of cellular automa

APA, Harvard, Vancouver, ISO, and other styles

9

Slotta, Douglas J. "Structural Design Using Cellular Automata." Thesis, Virginia Tech, 2001. http://hdl.handle.net/10919/33368.

Full text

Abstract:

Traditional parallel methods for structural design do not scale well. This thesis discusses the application of massively scalable cellular automata (CA) techniques to structural design. There are two sets of CA rules, one used to propagate stresses and strains, and one to perform design analysis. These rules can be applied serially, periodically, or concurrently, and Jacobi or Gauss-Seidel style updating can be done. These options are compared with respect to convergence, speed, and stability.<br>Master of Science

APA, Harvard, Vancouver, ISO, and other styles

10

Betel, Heather. "Properties and Behaviours of Fuzzy Cellular Automata." Thèse, Université d'Ottawa / University of Ottawa, 2012. http://hdl.handle.net/10393/22858.

Full text

Abstract:

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 b

APA, Harvard, Vancouver, ISO, and other styles

11

Louis, Pierre-Yves. "Increasing coupling for probabilistic cellular automata." Universität Potsdam, 2005. http://opus.kobv.de/ubp/volltexte/2006/659/.

Full text

Abstract:

We give a necessary and sufficient condition for the existence of an increasing coupling of N (N >= 2) synchronous dynamics on S-Zd (PCA). Increasing means the coupling preserves stochastic ordering. We first present our main construction theorem in the case where S is totally ordered; applications to attractive PCAs are given. When S is only partially ordered, we show on two examples that a coupling of more than two synchronous dynamics may not exist. We also prove an extension of our main result for a particular class of partially ordered spaces.

APA, Harvard, Vancouver, ISO, and other styles

12

Herr, Christiane Margerita. "From form generators to automated diagrams using cellular automata to support architectural design /." Thesis, Click to view the E-thesis via HKUTO, 2008. http://sunzi.lib.hku.hk/hkuto/record/B39848954.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Louis, Pierre-Yves. "Increasing Coupling of Probabilistic Cellular Automata." Universität Potsdam, 2004. http://opus.kobv.de/ubp/volltexte/2011/5157/.

Full text

Abstract:

We give a necessary and sufficient condition for the existence of an increasing coupling of N (N >= 2) synchronous dynamics on S-Zd (PCA). Increasing means the coupling preserves stochastic ordering. We first present our main construction theorem in the case where S is totally ordered; applications to attractive PCAs are given. When S is only partially ordered, we show on two examples that a coupling of more than two synchronous dynamics may not exist. We also prove an extension of our main result for a particular class of partially ordered spaces.

APA, Harvard, Vancouver, ISO, and other styles

14

Bolduc, Jean-Sebastien. "Cellular-automata based nonlinear adaptive controllers." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape10/PQDD_0002/MQ44128.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Weimar, Jörg Richard. "Cellular automata models for excitable media /." This resource online, 1991. http://scholar.lib.vt.edu/theses/available/etd-03032009-040651/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Bolduc, Jean-Sébastien. "Cellular-automata based nonlinear adaptive controllers." Thesis, McGill University, 1998. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=20804.

Full text

Abstract:

An analytical approach is obviously practical only when we want to study nonlinear systems of low complexity. An alternative for more complex processes that has raised a lot of interest in recent years relies on Artificial Neural Networks (ANNs).<br>In this work we will explore an alternative avenue to the problems of control and identification, where Cellular Automata (CAs) will be considered in place of ANNs. CAs not only share ANNs' most valuable characteristics but they also have interesting characteristics of their own, for a structurally simpler architecture. CAs applications so far have

APA, Harvard, Vancouver, ISO, and other styles

17

Smith, Mark Andrew. "Cellular automata methods in mathematical physics." Thesis, Massachusetts Institute of Technology, 1994. http://hdl.handle.net/1721.1/33501.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Weimar, JÃ¶rg Richard. "Cellular automata models for excitable media." Thesis, Virginia Tech, 1991. http://hdl.handle.net/10919/41365.

Full text

Abstract:

<p>A cellular automaton is developed for simulating excitable media. First, general "masks" as discrete approximations to the diffusion equation are examined, showing how to calculate the diffusion coefficient from the elements of the mask. The mask is then combined with a thresholding operation to simulate the propagation of waves (shock fronts) in excitable media, showing that (for well-chosen masks) the waves obey a linear "speedcurvature" relation with slope given by the predicted diffusion coefficient. The utility of different masks in terms of computational efficiency and adherence to a

APA, Harvard, Vancouver, ISO, and other styles

19

Hopman, Ryan. "Aribitrary geometry cellular automata for elastodynamics." Thesis, Atlanta, Ga. : Georgia Institute of Technology, 2009. http://hdl.handle.net/1853/29742.

Full text

Abstract:

Thesis (M. S.)--Mechanical Engineering, Georgia Institute of Technology, 2010.<br>Committee Chair: Dr. Michael Leamy; Committee Member: Dr. Karim Sabra; Committee Member: Dr. Aldo Ferri. Part of the SMARTech Electronic Thesis and Dissertation Collection.

APA, Harvard, Vancouver, ISO, and other styles

20

CAPOBIANCO, Silvio. "Structure and invertibility in cellular automata." Doctoral thesis, La Sapienza, 2005. http://hdl.handle.net/11573/917108.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Forrester, David M. "Fuzzy Cellular Automata in Conjunctive Normal Form." Thèse, Université d'Ottawa / University of Ottawa, 2011. http://hdl.handle.net/10393/19987.

Full text

Abstract:

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 empirica

APA, Harvard, Vancouver, ISO, and other styles

22

Alvandipour, Mehrdad. "Cellular Automata, Game of Life and Chance." Thesis, Southern Illinois University at Edwardsville, 2017. http://pqdtopen.proquest.com/#viewpdf?dispub=10615332.

Full text

Abstract:

<p> Cellular automata (CA) is shortly reviewed and different approaches to CAs are introduced, while the major focus is put on the Game of Life (GoL). While the GoL has deterministic rules, we suggest a method to make the game stochastic. An analysis of the new stochastic game is studied which focuses on a macroscopic characteristic of the field, the population density. The stochastic game is simulated with various different rules to compare the exact results with the analysis. The applicability of Markov chains and Markov random fields to such games is also studied briefly, while the final ch

APA, Harvard, Vancouver, ISO, and other styles

23

Ratitch, Bohdana. "Continuous function identification with fuzzy cellular automata." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape10/PQDD_0006/MQ44255.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Testa, Joseph S. "Investigations of cellular automata-based stream ciphers /." Online version of thesis, 2008. http://hdl.handle.net/1850/7897.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Waage, Aleksander Lunøe. "Discrete Tranformation of Output in Cellular Automata." Thesis, Norges teknisk-naturvitenskapelige universitet, Institutt for datateknikk og informasjonsvitenskap, 2012. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-22963.

Full text

Abstract:

Cellular automata (CA) is an example of cellular computing: large numbers of simple components, no central control, and limited communication among components. A CA consists of an array of cells, each in one of a finite number of possible states. The cells are updated synchronously in discrete time steps, according to a local, identical interaction rule. CA have been studied for years due to their architectural simplicity and the wide spectrum of behaviors. It can be difficult to design CA to exhibit a specific behavior, and there is no programming paradigm for implementing parallel computatio

APA, Harvard, Vancouver, ISO, and other styles

26

Jones, David Huw. "Design and application of convergent cellular automata." Thesis, Durham University, 2009. http://etheses.dur.ac.uk/84/.

Full text

Abstract:

Systems made of many interacting elements may display unanticipated emergent properties. A system for which the desired properties are the same as those which emerge will be inherently robust. Currently available techniques for designing emergent properties are prohibitively costly for all but the simplest systems. The self-assembly of biological cells into tissues and ultimately organisms is an example of a natural dynamic distributed system of which the primary emergent behaviour is a fully operational being. The distributed process that co-ordinates this self-assembly is morphogenesis. By a

APA, Harvard, Vancouver, ISO, and other styles

27

McIlhatton, David. "Spatial planning : cellular automata urban growth modelling." Thesis, University of Ulster, 2010. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.523107.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Xu, Hao, and 許浩. "On the computational ability of cellular automata." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2002. http://hub.hku.hk/bib/B31226942.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Kim, Bokhwan. "Modelling new city growth using cellular automata." Thesis, University of Leeds, 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.423002.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Dow, R. A. "Algebraic methods for finite linear cellular automata." Thesis, Queen Mary, University of London, 1996. http://qmro.qmul.ac.uk/xmlui/handle/123456789/1647.

Full text

Abstract:

Cellular automata are a simple class of extended dynamical systems which have been much studied in recent years. Linear cellular automata are the class of cellular automata most amenable to algebraic analytic treatments, algebraic techniques are used to study finite linear cellular automata and also finite linear cellular automata with external inputs. General results are developed for state alphabet a finite commutative ring and a notion of qualitative dynamical similarity is introduced for those systems consisting of a fixed linear cellular automata rule but with distinct time independent in

APA, Harvard, Vancouver, ISO, and other styles

31

Agin, Ruben. "Logic simulation on a cellular automata machine." Thesis, Massachusetts Institute of Technology, 1997. http://hdl.handle.net/1721.1/43474.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Demontis, Pierfranco, Federico G. Pazzona, and Giuseppe B. Suffritti. "Cellular automata modeling of diffusion under confinement." Universitätsbibliothek Leipzig, 2016. http://nbn-resolving.de/urn:nbn:de:bsz:15-qucosa-193309.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Adams, Roxane. "Implementation of cell clustering in cellular automata." Thesis, Stellenbosch : University of Stellenbosch, 2011. http://hdl.handle.net/10019.1/6674.

Full text

Abstract:

Thesis (MSc (Mathematical Sciences)) University of Stellenbosch, 2011.<br>ENGLISH ABSTRACT: Cellular Automata (CA) have become a popular vehicle to study complex dynamical behaviour of systems. CA can be used to model a wide variety of physical, biological, chemical and other systems. Such systems typically consist of subparts that change their state independently, based on the state of their immediate surroundings and some generally shared laws of change. When the CA approach was used to solve the LEGO construction problem, the best solution was found when using a variant of CA allowing

APA, Harvard, Vancouver, ISO, and other styles

34

Demontis, Pierfranco, Federico G. Pazzona, and Giuseppe B. Suffritti. "Cellular automata modeling of diffusion under confinement." Diffusion fundamentals 6 (2007) 13, S. 1-2, 2007. https://ul.qucosa.de/id/qucosa%3A14187.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Srivastava, Saket. "Probabilistic modeling of quantum-dot cellular automata." [Tampa, Fla.] : University of South Florida, 2007. http://purl.fcla.edu/usf/dc/et/SFE0002399.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Castro, Antonio Paulo. "Dynamic water quality modeling using cellular automata." Diss., This resource online, 1996. http://scholar.lib.vt.edu/theses/available/etd-06062008-151210/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Xu, Hao. "On the computational ability of cellular automata /." Hong Kong : University of Hong Kong, 2002. http://sunzi.lib.hku.hk/hkuto/record.jsp?B25155088.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Weeks, Andrew. "Neutral emergence and coarse graining cellular automata." Thesis, University of York, 2010. http://etheses.whiterose.ac.uk/2256/.

Full text

Abstract:

Emergent systems are often thought of as special, and are often linked to desirable properties like robustness, fault tolerance and adaptability. But, though not well understood, emergence is not a magical, unfathomable property. We introduce neutral emergence as a new way to explore emergent phenomena, showing that being good enough, enough of the time may actually yield more robust solutions more quickly. We then use cellular automata as a substrate to investigate emergence, and find they are capable of exhibiting emergent phenomena through coarse graining. Coarse graining shows us that emer

APA, Harvard, Vancouver, ISO, and other styles

39

Cenek, Martin. "Information Processing in Two-Dimensional Cellular Automata." PDXScholar, 2011. https://pdxscholar.library.pdx.edu/open_access_etds/275.

Full text

Abstract:

Cellular automata (CA) have been widely used as idealized models of spatially-extended dynamical systems and as models of massively parallel distributed computation devices. Despite their wide range of applications and the fact that CA are capable of universal computation (under particular constraints), the full potential of these models is unrealized to-date. This is for two reasons: (1) the absence of a programming paradigm to control these models to solve a given problem and (2) the lack of understanding of how these models compute a given task. This work addresses the notion of computation

APA, Harvard, Vancouver, ISO, and other styles

40

di, Lena Pietro <1977&gt. "Decidable and computational properties of cellular automata." Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2007. http://amsdottorato.unibo.it/371/1/dilena.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

di, Lena Pietro <1977&gt. "Decidable and computational properties of cellular automata." Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2007. http://amsdottorato.unibo.it/371/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

BONOMI, ANDREA. "Dissipative multilayered cellular automata facing adaptive lighting." Doctoral thesis, Università degli Studi di Milano-Bicocca, 2010. http://hdl.handle.net/10281/7822.

Full text

Abstract:

Cellular Automata have been primarily investigated as a theoretical model and as a method for simulation and modeling of complex system. CA are also an abstract and formal model of the cellular systems, a wide class of systems present in nature. h systems are composed of several cells acting with a certain degree of independence. The collective behavior is the result of the local interactions. The rationale of this work is to exploit this kind of self-organizing behavior present in biological systems to model, design and realize Distributed Control Systems. Adaptive Lighting is one of the para

APA, Harvard, Vancouver, ISO, and other styles

43

MARIOT, LUCA. "Cellular Automata, Boolean Functions and Combinatorial Designs." Doctoral thesis, Università degli Studi di Milano-Bicocca, 2018. http://hdl.handle.net/10281/199011.

Full text

Abstract:

Lo scopo di questa tesi è studiaregli Automi Cellulari (AC) dalla prospettiva delle funzioni booleane e dei disegni combinatorici. Oltre all'intrinseco interesse teorico, questa ricerca è motivata da applicazioni alla crittografia, dato che sia le funzioni booleane che i disegni combinatorici sono utilizzati nella progettazione di generatori di numeri pseudocasuali (Pseudorandom Number Generators}, PRNG) e degli schemi di condivisione di segreti (Secret Sharing Schemes, SSS). I contributi della tesi sono stati sviluppati lungo tre linee di ricerca, di seguito descritte. La prima linea di

APA, Harvard, Vancouver, ISO, and other styles

44

Eon, Nathanaël. "Gauge invariance in classical and quantum cellular automata." Electronic Thesis or Diss., Aix-Marseille, 2022. http://www.theses.fr/2022AIXM0281.

Full text

Abstract:

L'invariance de jauge est un concept fondamental en physique, servant de fondement mathématique à la dérivation des interactions fondamentales. Dans cette thèse, la notion d'invariance de jauge est formalisée dans le cadre des automates cellulaires (AC).Cette formalisation offre un chemin simple et direct vers les concepts essentiels de la symétrie de jauge. Usuellement, une symétrie de jauge est tout d'abord motivée par l'existence d'une symétrie globale. La théorie est ensuite étendue de sorte que cette symétrie devienne locale. Les AC permettent de formaliser ce processus d'extension de jau

APA, Harvard, Vancouver, ISO, and other styles

45

Weston, James. "Cellular Automata Based Binary Arithmetic Implemented Within A Fault Tolerant Cellular Architecture." Thesis, University of Kent, 2008. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.499644.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Fransson, Linnea. "Monomial Cellular Automata : A number theoretical study on two-dimensional cellular automata in the von Neumann neighbourhood over commutative semigroups." Thesis, Linnéuniversitetet, Institutionen för matematik (MA), 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-51865.

Full text

Abstract:

In this report, we present some of the results achieved by investigating two-dimensional monomial cellular automata modulo m, where m is a non-zero positive integer. Throughout the experiments, we work with the von Neumann neighbourhood and apply the same local rule based on modular multiplication. The purpose of the study is to examine the behaviour of these cellular automata in three different environments, (i.e. the infinite plane, the finite plane and the torus), by means of elementary number theory. We notice how the distance between each pair of cells with state 0 influences the evolutio

APA, Harvard, Vancouver, ISO, and other styles

47

甄冠僑 and Koon-kiu Yan. "Phase transition of certain iterative cellular automation models." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1999. http://hub.hku.hk/bib/B42575382.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Yan, Koon-kiu. "Phase transition of certain iterative cellular automation models." Click to view the E-thesis via HKUTO, 1999. http://sunzi.lib.hku.hk/hkuto/record/B42575382.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Dridi, Sara. "Recent advances in regional controllability of cellular automata." Doctoral thesis, Perpignan, 2019. http://hdl.handle.net/2158/1181181.

Full text

Abstract:

The issue addressed in this thesis concerns the controllability of a class of dis- crete spatio-temporal systems named cellular automata (CA). The purpose of this study is to highlight new ways to prove the controllability of complex systems. More specifically, this thesis focuses on regional controllability which consists in restricting the study to a subregion of the domain where the system will have to achieve a given objective through targeted actions. The case of Boolean CA have been particularly examined throughout this thesis. The first part is devoted to the study of the prob- lem of t

APA, Harvard, Vancouver, ISO, and other styles

50

Li, Gang. "Anisotropic wet etch simulation using vector cellular automata." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp01/MQ39675.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!