Dissertations / Theses on the topic 'Cellular automata'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
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.
Collins, Sean. "Interactive cellular automata." Thesis, Lancaster University, 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.435877.
Full textEpperlein, 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 textRakotomalala, Livaniaina Hary. "Network Decontamination Using Cellular Automata." Thesis, Université d'Ottawa / University of Ottawa, 2016. http://hdl.handle.net/10393/34095.
Full textWeimar, 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 textDeng, 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 textSerquera, Jaime. "Sound synthesis with cellular automata." Thesis, University of Plymouth, 2012. http://hdl.handle.net/10026.1/1189.
Full textPowley, Edward Jack. "Global properties of cellular automata." Thesis, University of York, 2009. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.516655.
Full textClewlow, Les. "Cellular automata and dynamical systems." Thesis, University of Warwick, 1989. http://wrap.warwick.ac.uk/4233/.
Full textSlotta, Douglas J. "Structural Design Using Cellular Automata." Thesis, Virginia Tech, 2001. http://hdl.handle.net/10919/33368.
Full textMaster of Science
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 textLouis, Pierre-Yves. "Increasing coupling for probabilistic cellular automata." Universität Potsdam, 2005. http://opus.kobv.de/ubp/volltexte/2006/659/.
Full textHerr, 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 textLouis, Pierre-Yves. "Increasing Coupling of Probabilistic Cellular Automata." Universität Potsdam, 2004. http://opus.kobv.de/ubp/volltexte/2011/5157/.
Full textBolduc, 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 textWeimar, Jörg Richard. "Cellular automata models for excitable media /." This resource online, 1991. http://scholar.lib.vt.edu/theses/available/etd-03032009-040651/.
Full textBolduc, 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 textIn 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 been mainly restrained to simulating natural phenomena occuring in a finite homogeneous space.
Concepts relevant to the problems of control and identification will be introduced in the first part of our work. CAs will then be introduced, with a discussion of the issues raised by their application in the context, A working prototype of a CA-based controller is introduced in the last part of the work, that confirms the interest of using CAs to address the problem of nonlinear adaptive control. (Abstract shortened by UMI.)
Smith, Mark Andrew. "Cellular automata methods in mathematical physics." Thesis, Massachusetts Institute of Technology, 1994. http://hdl.handle.net/1721.1/33501.
Full textWeimar, Jörg Richard. "Cellular automata models for excitable media." Thesis, Virginia Tech, 1991. http://hdl.handle.net/10919/41365.
Full textA 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 linear speed-curvature relation is assessed. Then, a cellular automaton model for wave propagation in reaction diffusion systems is constructed based on these "masks" for the diffusion component and on singular perturbation analysis for the reaction component. The cellular automaton is used to model spiral waves in the Belousov-Zhabotinskii reaction. The behavior of the spiral waves and the movement of the spiral tip are analyzed. By comparing these results to solutions of the Oregonator PDE model, the automaton is shown to be a useful and efficient replacement for the standard numerical solution of the PDE's.
Master of Science
Hopman, Ryan. "Aribitrary geometry cellular automata for elastodynamics." Thesis, Atlanta, Ga. : Georgia Institute of Technology, 2009. http://hdl.handle.net/1853/29742.
Full textCommittee Chair: Dr. Michael Leamy; Committee Member: Dr. Karim Sabra; Committee Member: Dr. Aldo Ferri. Part of the SMARTech Electronic Thesis and Dissertation Collection.
CAPOBIANCO, Silvio. "Structure and invertibility in cellular automata." Doctoral thesis, La Sapienza, 2005. http://hdl.handle.net/11573/917108.
Full textForrester, 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 textAlvandipour, Mehrdad. "Cellular Automata, Game of Life and Chance." Thesis, Southern Illinois University at Edwardsville, 2017. http://pqdtopen.proquest.com/#viewpdf?dispub=10615332.
Full textCellular 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 chapter of our work consists of a stochastic game inside a finite grid which is modeled by Markov chains. The structure of the states, the transition probabilities and other aspects of the model is both analyzed and simulated. And finally relevant directions to expand this study is suggested.
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 textTesta, Joseph S. "Investigations of cellular automata-based stream ciphers /." Online version of thesis, 2008. http://hdl.handle.net/1850/7897.
Full textWaage, 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 textJones, David Huw. "Design and application of convergent cellular automata." Thesis, Durham University, 2009. http://etheses.dur.ac.uk/84/.
Full textMcIlhatton, 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 textXu, 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 textKim, 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 textDow, 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 textAgin, Ruben. "Logic simulation on a cellular automata machine." Thesis, Massachusetts Institute of Technology, 1997. http://hdl.handle.net/1721.1/43474.
Full textDemontis, 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 textAdams, Roxane. "Implementation of cell clustering in cellular automata." Thesis, Stellenbosch : University of Stellenbosch, 2011. http://hdl.handle.net/10019.1/6674.
Full textENGLISH 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 for the clustering of cells. The LEGO construction problem concerns the optimal layout of a set of LEGO bricks. The advantages found for using the CA method with clustering in this case are the ease of implementation, the significantly smaller memory usage to previously implemented methods, and its trivial extension to construct multicoloured LEGO sculptures which were previously too complex to construct. In our research we propose to explore the definitions of clustering in CA and investigate the implementation and application of this method. We look at the ant sorting method described by Lumer and Faieta, and compare the implementation of this algorithm using regular CA as well as the clustering variation. The ant sorting model is a simple model, in which ants move randomly in space and pick up and deposit objects on the basis of local information.
AFRIKAANSE OPSOMMING: Sellulêre Outomate (SO) het ’n populêre metode geword om die komplekse dinamiese gedrag van sisteme bestudeer. SO kan gebruik word om ’n groot verskeidenheid fisiese, biologiese, chemiese en ander tipe sisteme te modelleer. Sulke sisteme bestaan tipies uit subafdelings wat, gebaseer op die status van hulle omgewing en ’n paar algemene gedeelde reëls van verandering, hulle status onafhanklik verander. Met die gebruik van die SO benadering om the LEGO konstruksieprobleem op te los, is die beste oplossing bereik deur gebruik te maak van ’n variant van SO, waar selle saamgroepeer kan word. Die LEGO konstruksieprobleem behels die optimale uitleg van ’n stel LEGO blokkies. In hierdie geval is die voordele van die SO met sel groepering die maklike implementasie, ’n beduidende kleiner geheuegebruik teenoor voorheen geïmplementeerde metodes, en die triviale uitbreiding daarvan om gekleurde LEGO beelde wat voorheen te kompleks was, te kan bou. In ons ondersoek verken ons die definisies van selgroepering in SO en ondersoek die implementasie en toepassing van die metode. Ons kyk na die miersorteringsmetode beskryf deur Lumer en Faieta, en vergelyk die implementasie van hierdie algoritme deur gewone SO asook die groeperingsvariasie te gebruik. Die miersorteringsmodel is ’n eenvoudige model waarin miere lukraak in ’n omgewing beweeg en voorwerpe optel of neersit volgens plaaslike inligting.
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 textSrivastava, Saket. "Probabilistic modeling of quantum-dot cellular automata." [Tampa, Fla.] : University of South Florida, 2007. http://purl.fcla.edu/usf/dc/et/SFE0002399.
Full textCastro, 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 textXu, 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 textWeeks, Andrew. "Neutral emergence and coarse graining cellular automata." Thesis, University of York, 2010. http://etheses.whiterose.ac.uk/2256/.
Full textCenek, Martin. "Information Processing in Two-Dimensional Cellular Automata." PDXScholar, 2011. https://pdxscholar.library.pdx.edu/open_access_etds/275.
Full textdi, Lena Pietro <1977>. "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 textdi, Lena Pietro <1977>. "Decidable and computational properties of cellular automata." Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2007. http://amsdottorato.unibo.it/371/.
Full textBONOMI, ANDREA. "Dissipative multilayered cellular automata facing adaptive lighting." Doctoral thesis, Università degli Studi di Milano-Bicocca, 2010. http://hdl.handle.net/10281/7822.
Full textMARIOT, LUCA. "Cellular Automata, Boolean Functions and Combinatorial Designs." Doctoral thesis, Università degli Studi di Milano-Bicocca, 2018. http://hdl.handle.net/10281/199011.
Full textThe goal of this thesis is to investigate Cellular Automata (CA) from the perspective of Boolean functions and combinatorial designs. Besides the inherent theoretical interest, this research also bases its motivation in cryptography, since Boolean functions and combinatorial designs have several applications in the design of Pseudorandom Number Generators (PRNG) and Secret Sharing Schemes (SSS). The contributions presented in this thesis are developed along three main research lines, organized as follows. The first research line concerns the use of heuristic optimization algorithms for designing Boolean functions with good cryptographic properties, to be used as local rules in CA-based PRNG. The main motivation is to improve Wolfram's pseudorandom generator, which has been shown to be vulnerable to two cryptanalytic attacks due to the poor cryptographic properties of rule 30. In this research line, we first develop a discrete Particle Swarm Optimizer (PSO) which explores the space of truth tables of balanced Boolean functions having good nonlinearity, resiliency and propagation criteria. Next, we design a Genetic Algorithm (GA) which works on a different representation of Boolean functions, namely their Walsh spectrum. The second research line deals with vectorial Boolean functions generated by CA global rules. The first contribution investigates the period of preimages of spatially periodic configurations under the action of surjective CA, a problem which is related to the maximum number of players in a CA-based SSS already published in the literature. The second contribution analyzes the cryptographic properties of CA global rules, focusing on their algebraic degree, nonlinearity and differential uniformity. We then adopt a heuristic approach based on Genetic Programming (GP) to evolve S-boxes defined by CA with nonlinearity and differential uniformity. As a last contribution in this research line, we focus on the resiliency criterion and introduce a new cryptographic property for CA-based S-boxes, namely asynchrony immunity. The third research line deals with combinatorial designs generated by CA. We specifically focus on the case of Orthogonal Latin Squares (OLS), since they are equivalent to perfect authentication codes and threshold secret sharing schemes. To this end, our first contribution in this research line concerns the construction and the enumeration of OLS generated through linear CA, leveraging on results from the theory of finite fields. The second contribution, on the other hand, extends the investigation to OLS generated by nonlinear CA, using both a combinatorial approach for exhaustive enumeration and a heuristic approach based on GA and GP.
Eon, Nathanaël. "Gauge invariance in classical and quantum cellular automata." Electronic Thesis or Diss., Aix-Marseille, 2022. http://www.theses.fr/2022AIXM0281.
Full textGauge invariance is a fundamental concept in Physics, known to provide mathematical justification for the fundamental forces. In this thesis, gauge invariance is brought to the realm of classical and quantum cellular automata (CA). In a classical setting, it provides a simple yet rigorous route straight to the core concepts of gauge theories. Usually, gauge theories are built from a theory featuring a global symmetry, which is then extended to make the symmetry a local one (a.k.a. gauge-invariant). CA allows for this gauge extension process to be made formal. We show the equivalence between the pre-existence of a global symmetry and the ability to perform a "relative" gauge extension. Moreover, gauge invariant cellular automata are shown to be universal. In the framework of quantum cellular automata (QCA), we use gauge invariance to construct a discrete spacetime formulation of 3+1 quantum electrodynamics (QED). It takes the form of a quantum circuit, infinitely repeating across space and time, parameterized by the relativistic discretization step \Delta_t=\Delta_x. The construction replays the logic that leads to the QED Lagrangian. Namely, it starts from the Dirac quantum walk, well-known to converge towards free relativistic fermions. It then extends the quantum walk into a multi-particle sector quantum cellular automata in a way which respects the fermionic anti-commutation relations and the discrete gauge invariance symmetry. Lastly the gauge field is given its own electromagnetic dynamics
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 textFransson, 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甄冠僑 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 textYan, 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 textDridi, Sara. "Recent advances in regional controllability of cellular automata." Doctoral thesis, Perpignan, 2019. http://hdl.handle.net/2158/1181181.
Full textLi, 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