Log in

Relevant bibliographies by topics / Cellullar automata

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers
Reports

Academic literature on the topic 'Cellullar automata'

Author: Grafiati

Published: 19 February 2023

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

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Cellullar 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.

Journal articles on the topic "Cellullar automata"

1

Melati, Dian Nuraini. "Multi Temporal Remotely Sensed Image Modelling For Deforestation Monitoring." Jurnal Alami : Jurnal Teknologi Reduksi Risiko Bencana 3, no. 1 (May 31, 2019): 43. http://dx.doi.org/10.29122/alami.v3i1.3368.

Full text

Abstract:

Tropical rainforest in Indonesia faces critical issue related to deforestation. Human activities which convert forest cover into non-forest cover has been a major issue. In order to sustain the forest resources, monitoring on deforestation and forest cover prediction is necessary to be done. Remotely sensed data, Landsat images, with acquisition in 1996, 2000, and 2005 are used in this study. In this study area, forest cover decreased around 6 % in the period of 1996 - 2005. For the purpose of forest cover modelling, three model (i.e. Stochastic Markov Model, Cellullar Automata Markov (CA_Markov) Model, dan GEOMOD) were tested. Based upon the Kappa index, GEOMOD performed better with the highest Kappa index. Therefore, GEOMOD is recommended to forecast forest cover.

APA, Harvard, Vancouver, ISO, and other styles

2

Jung, Goeun, and Youngho Kim. "Modeling of Spatio-temporal changes of Urban Sprawl in Jeju-island: Using CA (Cellular Automata) and ARD (Automatic Rule Detection)." Journal of the Association of Korean Geographers 10, no. 1 (April 30, 2021): 139–52. http://dx.doi.org/10.25202/jakg.10.1.9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

TORBEY, SAMI. "TOWARDS A FRAMEWORK FOR INTUITIVE PROGRAMMING OF CELLULAR AUTOMATA." Parallel Processing Letters 19, no. 01 (March 2009): 73–83. http://dx.doi.org/10.1142/s0129626409000079.

Full text

Abstract:

The ability to obtain complex global behaviour from simple local rules makes cellular automata an interesting platform for massively parallel computation. However, manually designing a cellular automaton to perform a given computation can be extremely difficult, and automated design techniques such as genetic programming have their limitations because of the absence of human intuition. In this paper, we propose elements of a framework whose goal is to make the manual synthesis of cellular automata rules exhibiting desired global characteristics more programmer-friendly, while maintaining the simplicity of local processing elements. Although many of the framework elements that we describe here are not new, we group them into a consistent framework and show that they can all be implemented on a traditional cellular automaton, which means that they are merely more human-friendly ways of describing simple cellular automata rules, and not foreign structures that require changing the traditional cellular automaton model.

APA, Harvard, Vancouver, ISO, and other styles

4

Rowland, Eric, and Reem Yassawi. "Automaticity and Invariant Measures of Linear Cellular Automata." Canadian Journal of Mathematics 72, no. 6 (September 5, 2019): 1691–726. http://dx.doi.org/10.4153/s0008414x19000488.

Full text

Abstract:

AbstractWe show that spacetime diagrams of linear cellular automata $\unicode[STIX]{x1D6F7}:\,\mathbb{F}_{p}^{\mathbb{Z}}\rightarrow \mathbb{F}_{p}^{\mathbb{Z}}$ with $(-p)$-automatic initial conditions are automatic. This extends existing results on initial conditions that are eventually constant. Each automatic spacetime diagram defines a $(\unicode[STIX]{x1D70E},\unicode[STIX]{x1D6F7})$-invariant subset of $\mathbb{F}_{p}^{\mathbb{Z}}$, where $\unicode[STIX]{x1D70E}$ is the left shift map, and if the initial condition is not eventually periodic, then this invariant set is nontrivial. For the Ledrappier cellular automaton we construct a family of nontrivial $(\unicode[STIX]{x1D70E},\unicode[STIX]{x1D6F7})$-invariant measures on $\mathbb{F}_{3}^{\mathbb{Z}}$. Finally, given a linear cellular automaton $\unicode[STIX]{x1D6F7}$, we construct a nontrivial $(\unicode[STIX]{x1D70E},\unicode[STIX]{x1D6F7})$-invariant measure on $\mathbb{F}_{p}^{\mathbb{Z}}$ for all but finitely many $p$.

APA, Harvard, Vancouver, ISO, and other styles

5

Barragan-Vite, Irving, Juan C. Seck-Tuoh-Mora, Norberto Hernandez-Romero, Joselito Medina-Marin, and Eva S. Hernandez-Gress. "Distributed Control of a Manufacturing System with One-Dimensional Cellular Automata." Complexity 2018 (October 4, 2018): 1–15. http://dx.doi.org/10.1155/2018/7235105.

Full text

Abstract:

We present a distributed control modeling approach for an automated manufacturing system based on the dynamics of one-dimensional cellular automata. This is inspired by the fact that both cellular automata and manufacturing systems are discrete dynamical systems where local interactions given among their elements (resources) can lead to complex dynamics, despite the simple rules governing such interactions. The cellular automaton model developed in this study focuses on two states of the resources of a manufacturing system, namely, busy or idle. However, the interaction among the resources such as whether they are shared at different stages of the manufacturing process determines the global dynamics of the system. A procedure is shown to obtain the local evolution rule of the automaton based on the relationships among the resources and the material flow through the manufacturing process. The resulting distributed control of the manufacturing system appears to be heterarchical, and the evolution of the cellular automaton exhibits a Class II behavior for some given disordered initial conditions.

APA, Harvard, Vancouver, ISO, and other styles

6

BOCCARA, NINO. "RANDOMIZED CELLULAR AUTOMATA." International Journal of Modern Physics C 18, no. 08 (August 2007): 1303–12. http://dx.doi.org/10.1142/s0129183107011339.

Full text

Abstract:

We define and study a few properties of a class of random automata networks. While regular finite one-dimensional cellular automata are defined on periodic lattices, these automata networks, called randomized cellular automata, are defined on random directed graphs with constant out-degrees and evolve according to cellular automaton rules. For some families of rules, a few typical a priori unexpected results are presented.

APA, Harvard, Vancouver, ISO, and other styles

7

Mardiris, Vassilios A., Georgios Ch Sirakoulis, and Ioannis G. Karafyllidis. "Automated Design Architecture for 1-D Cellular Automata Using Quantum Cellular Automata." IEEE Transactions on Computers 64, no. 9 (September 1, 2015): 2476–89. http://dx.doi.org/10.1109/tc.2014.2366745.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Allouche, J. P., F. V. Haeseler, E. Lange, A. Petersen, and G. Skordev. "Linear cellular automata and automatic sequences." Parallel Computing 23, no. 11 (November 1997): 1577–92. http://dx.doi.org/10.1016/s0167-8191(97)00074-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

DUBACQ, JEAN-CHRISTOPHE. "HOW TO SIMULATE TURING MACHINES BY INVERTIBLE ONE-DIMENSIONAL CELLULAR AUTOMATA." International Journal of Foundations of Computer Science 06, no. 04 (December 1995): 395–402. http://dx.doi.org/10.1142/s0129054195000202.

Full text

Abstract:

The issue of testing invertibility of cellular automata has been often discussed. Constructing invertible automata is very useful for simulating invertible dynamical systems, based on local rules. The computation universality of cellular automata has long been positively resolved, and by showing that any cellular automaton could be simulated by an invertible one having a superior dimension, Toffoli proved that invertible cellular automaton of dimension d≥2 were computation-universal. Morita proved that any invertible Turing Machine could be simulated by a one-dimensional invertible cellular automaton, which proved computation-universality of invertible cellular automata. This article shows how to simulate any Turing Machine by an invertible cellular automaton with no loss of time and gives, as a corollary, an easier proof of this result.

APA, Harvard, Vancouver, ISO, and other styles

10

Zhukov, Alexey E. "The reversibility of one-dimensional cellular automata." RUDN Journal of Engineering Researches 22, no. 1 (August 27, 2021): 7–15. http://dx.doi.org/10.22363/2312-8143-2021-22-1-7-15.

Full text

Abstract:

Recently the reversible cellular automata are increasingly used to build high-performance cryptographic algorithms. The paper establishes a connection between the reversibility of homogeneous one-dimensional binary cellular automata of a finite size and the properties of a structure called binary filter with input memory and such finite automata properties as the prohibitions in automata output and loss of information. We show that finding the preimage for an arbitrary configuration of a one-dimensional cellular automaton of length L with a local transition function f is associated with reversibility of a binary filter with input memory. As a fact, the nonlinear filter with an input memory corresponding to our cellular automaton does not depend on the number of memory cells of the cellular automaton. The results obtained make it possible to reduce the complexity of solving massive enumeration problems related to the issues of reversibility of cellular automata. All the results obtained can be transferred to cellular automata with non-binary cell filling and to cellular automata of dimension greater than 1.

APA, Harvard, Vancouver, ISO, and other styles

More sources

Dissertations / Theses on the topic "Cellullar automata"

1

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

2

Luža, Jindřich. "Návrh výpočetních struktur v celulárních automatech." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2014. http://www.nusl.cz/ntk/nusl-236089.

Full text

Abstract:

The goal of this master thesis is to examine possibilities of realizing comptutational structures in cellular automata. The work describes the fundamental principles of cellular automata and summarizes some ways of how to achive the specified goal. An overview of Turing-complete and other specialized computational tasks is proposed considering both 1D and 2D cellular automata. It is shown that different computational scenarios in cellular automata can be considered with various setups of the input and output arrangements. With regard to showed inputs and outputs arrangement, sets of tests is designed to find solutions of choosen computational structures on cellular automata with use of choosen evolutionary algorithm. Found solutions are compared by computational resources consumption and difficulty of discovery later.

APA, Harvard, Vancouver, ISO, and other styles

3

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

4

Olkerud, Marcus, and Martin Virke. "Processuell generering av oändliga spelvärldar : Praktiska problem och optimering." Thesis, Södertörns högskola, Institutionen för naturvetenskap, miljö och teknik, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:sh:diva-22949.

Full text

Abstract:

Enligt oss så är det största problemet med att processuellt generera en pseudo-oändlig spelvärld i realtid är att få genereringen att ske så sömlöst som möjligt samtidigt som världen upplevs som konsekvent. För att finna lösningar på detta problem så analyserar vi andra studier och spel som utnyttjar processuell generering. Vi använder sedan de metoder och tekniker vi funnit för skapandet av en egen applikation för att få en djupare förståelse för hur dessa fungerar i praktiken och hur mycket varje metod påverkar prestandan. I vår slutsats beskriver vi de problem vi fann, deras orsak och ger förslag på lösningar. På grund av studiens tekniska karaktär så riktar den sig främst till programmerare. Vi hoppas att med denna studie kunna komplettera andra studier inom detta, enligt oss, relativt outforskade område.
According to us, the biggest problem with procedurally generating a pseudo-infinite game world in real-time is to have it generate as seamlessly as possible and keeping the world consistent at the same time. In order to come up with solutions to this problem we analyzed other studies and games which utilize procedural generation. We then used the methods we found in order to create our own application to further understand how they work in practice and how much each method affexts the performance of said application. In our conclusion we describe the problems that arose as well as explain what caused them, as well as present possible solutions to them. Due to the technical nature of this study it is mainly aimed at programmers. We hope that this study can complement other studies within what we think is a relatively unexplored subject.

APA, Harvard, Vancouver, ISO, and other styles

5

NETO, OMAR PARANAIBA VILELA. "SIMULATION AND AUTOMATIC SYNTHESES OF QUANTUM DOTS CELLULAR AUTOMATA CIRCUITS THOUGHT INTELLIGENT TECHNIQUES." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2006. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=8729@1.

Full text

Abstract:

CONSELHO NACIONAL DE DESENVOLVIMENTO CIENTÍFICO E TECNOLÓGICO
Esta dissertação investiga e propõe um novo simulador de circuitos de Autômatos Celulares com Pontos Quânticos (QCA) e uma nova metodologia para a criação e otimização de circuitos lógicos, utilizando técnicas da inteligência computacional. Autômatos Celulares com Pontos Quânticos é uma nova tecnologia, na escala nanométrica, que tem chamado a atenção dos pesquisadores por ser uma alternativa à tecnologia CMOS, cujo limite físico de miniaturização será atingido nos próximos anos. QCA tem um grande potencial no desenvolvimento de circuitos com maior densidade espacial, maior velocidade, baixa dissipação e baixo consumo de energia. Ao contrário das tecnologias tradicionais, QCA não codifica a informação pelo fluxo de corrente elétrica, mas pela configuração das cargas elétricas no interior das células. A interação coulombiana entre as células garante o fluxo da informação. Apesar de simples, essas características fazem com que a arquitetura de circuitos de QCA se torne não trivial. Portanto, a criação de um simulador e de uma metodologia de elaboração e síntese automática de circuitos possibilitam aos cientistas uma melhor visualização de como esses dispositivos funcionam, acelerando o desenvolvimento desses sistemas na escala nanométrica. Para atingir o objetivo proposto, técnicas de inteligência computacional, tais como redes neurais do tipo Hopfield, para o desenvolvimento do simulador, e algoritmos genéticos, para a metodologia de criação e otimização dos circuitos, foram empregadas. Os resultados encontrados foram significativos, comprovando que as técnicas da inteligência computacional podem ser uma ferramenta estratégica para o rápido desenvolvimento da nanoeletrônica e da nanotecnologia em geral.
This dissertation investigates and considers a new simulator of Quantum Dots Cellular Automata (QCA) Circuits and a new methodology for the synthesis and optimization of logical circuits, by means of Computational Intelligence. Quantum-dot Cellular Automata (QCA) is a new technology in the nanometric scale which has called attention from researchers as one alternative for the CMOS technology, which is reaching its physical limitation. QCA have a large potential in the development of circuits with high space density and low heat dissipation, and can allow the development of faster computers with lower power consumption. Differently from the conventional technologies, QCA do not codify information by means of electric current flow, but rather by the configuration of electrical charges in the interior of the cells. The Coulomb interaction between cells is responsible by the flow of information. Despite simple, these features become the design of logical devices into a non-trivial task. Therefore, the development of a simulator and a methodology of automatic synthesis of QCA circuits make possible to the scientist a better evaluation of how these circuits work, accelerating the development of these new systems in the nanometer scale. To reach the proposed target, Computational Intelligence techniques were used. The first results show that these techniques are capable of simulating efficiently and fast, synthesizing optimized circuits with a reduced number of cells. Such optimization reduces the possibility of failures and guarantees higher speed.

APA, Harvard, Vancouver, ISO, and other styles

6

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 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.

APA, Harvard, Vancouver, ISO, and other styles

7

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 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.

APA, Harvard, Vancouver, ISO, and other styles

8

Skorkovský, Petr. "Tvorba operačního systému založeného na evolučních a genetických algoritmech." Doctoral thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2013. http://www.nusl.cz/ntk/nusl-233610.

Full text

Abstract:

The main goal of the work is to introduce new ideas how traditional approaches for designing an operation system and associated software can be improved to be a part of automatic software evolution. It is generally supposed that algorithms found by the genetic programming processes cannot be used for exact calculations but only for approximate solutions. Several examples of software evolution are introduced, to show that quite precise solutions can be achieved. To reach this goal, characteristics of tree-like structures with approaches based on cellular automata features are combined in a new promising technique of algorithm representation, joining benefits of both concepts. An application has been developed based on these new genetic programming concepts and it is supposed it can be a part of a future automatic software evolution process.

APA, Harvard, Vancouver, ISO, and other styles

9

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-homeomorphic subshifts whose disjoint sums with themselves are homeomorphic. From this we can construct two cellular automata on homeomorphic state spaces for which all points have minimal period two, which are, however, not topologically conjugate. We apply our methods to classify the 256 elementary cellular automata with radius one over the binary alphabet up to topological conjugacy. By means of linear algebra over the field with two elements and identities between Fibonacci-polynomials we show that every conjugacy between rule 90 and rule 150 cannot have only a finite number of local rules. Finally, we look at the sequences of finite dynamical systems obtained by restricting cellular automata to spatially periodic points. If these sequences are termwise conjugate, we call the cellular automata conjugate on all tori. We then study the invariants under this notion of isomorphism. By means of an appropriately defined entropy, we can show that surjectivity is such an invariant.

APA, Harvard, Vancouver, ISO, and other styles

10

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 accomplish the decontamination in an optimal way. The metrics used to define optimality is the minimization of three metrics: the maximum number of decontaminating cells at each step, the required value of the immunity time of each cell and the number of steps to complete the sanitization algorithm. In our research, we explore the designing of these local decontamination rules by refining the concept of the neighbourhood radius of CA with the addition of two new dimensions: Visibility Hop and Contamination Distance. Additionally, a research tool that help us manage our study have been developed.

APA, Harvard, Vancouver, ISO, and other styles

More sources

Books on the topic "Cellullar automata"

1

Game of life cellular automata. London: Springer, 2010.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

Chopard, Bastien, Stefania Bandini, Alberto Dennunzio, and Mira Arabi Haddad, eds. Cellular Automata. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-14926-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Mauri, Giancarlo, Samira El Yacoubi, Alberto Dennunzio, Katsuhiro Nishinari, and Luca Manzoni, eds. Cellular Automata. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-99813-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Bandini, Stefania, Bastien Chopard, and Marco Tomassini, eds. Cellular Automata. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45830-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Sirakoulis, Georgios Ch, and Stefania Bandini, eds. Cellular Automata. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-33350-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Bandini, Stefania, Sara Manzoni, Hiroshi Umeo, and Giuseppe Vizzari, eds. Cellular Automata. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-15979-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

El Yacoubi, Samira, Jaroslaw Wąs, and Stefania Bandini, eds. Cellular Automata. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-44365-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Schiff, Joel L. Cellular Automata. Hoboken, NJ, USA: John Wiley & Sons, Inc., 2007. http://dx.doi.org/10.1002/9781118032381.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Delorme, M., and J. Mazoyer, eds. Cellular Automata. Dordrecht: Springer Netherlands, 1999. http://dx.doi.org/10.1007/978-94-015-9153-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Umeo, Hiroshi, Shin Morishita, Katsuhiro Nishinari, Toshihiko Komatsuzaki, and Stefania Bandini, eds. Cellular Automata. Berlin, Heidelberg: Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-79992-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Book chapters on the topic "Cellullar automata"

1

Formenti, Enrico, and Petr Kůrka. "Dynamics of Cellular Automata in Noncompact Spaces." In Cellular Automata, 323–35. New York, NY: Springer US, 2009. http://dx.doi.org/10.1007/978-1-4939-8700-9_138.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Cervelle, Julien, and Enrico Formenti. "Algorithmic Complexity and Cellular Automata." In Cellular Automata, 459–77. New York, NY: Springer US, 2009. http://dx.doi.org/10.1007/978-1-4939-8700-9_17.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Pivato, Marcus. "Ergodic Theory of Cellular Automata." In Cellular Automata, 373–418. New York, NY: Springer US, 2009. http://dx.doi.org/10.1007/978-1-4939-8700-9_178.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Cenek, Martin, and Melanie Mitchell. "Evolving Cellular Automata." In Cellular Automata, 543–54. New York, NY: Springer US, 2009. http://dx.doi.org/10.1007/978-1-4939-8700-9_191.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Umeo, Hiroshi. "Firing Squad Synchronization Problem in Cellular Automata." In Cellular Automata, 583–639. New York, NY: Springer US, 2018. http://dx.doi.org/10.1007/978-1-4939-8700-9_211.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Bays, Carter. "Gliders in Cellular Automata." In Cellular Automata, 261–73. New York, NY: Springer US, 2009. http://dx.doi.org/10.1007/978-1-4939-8700-9_249.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Gravner, Janko. "Growth Phenomena in Cellular Automata." In Cellular Automata, 291–308. New York, NY: Springer US, 2018. http://dx.doi.org/10.1007/978-1-4939-8700-9_266.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Adamatzky, Andrew. "Identification of Cellular Automata." In Cellular Automata, 733–47. New York, NY: Springer US, 2018. http://dx.doi.org/10.1007/978-1-4939-8700-9_280.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Voorhees, Burton. "Additive Cellular Automata." In Cellular Automata, 129–51. New York, NY: Springer US, 2009. http://dx.doi.org/10.1007/978-1-4939-8700-9_4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Boccara, Nino. "Phase Transitions in Cellular Automata." In Cellular Automata, 705–18. New York, NY: Springer US, 2009. http://dx.doi.org/10.1007/978-1-4939-8700-9_405.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Cellullar automata"

1

Carrijo, José, Anderson C. A. Nascimento, Rafael Tonicelli, and Vinícius de Morais Alves. "Fault Attacks against a Cellular Automata Based Stream Cipher." In Simpósio Brasileiro de Segurança da Informação e de Sistemas Computacionais. Sociedade Brasileira de Computação - SBC, 2011. http://dx.doi.org/10.5753/sbseg.2011.20565.

Full text

Abstract:

This paper presents fault attacks against a cellular automata based stream cipher. A fault attack assumes that the adversary is able to physically operate the cryptographic device and insert some errors into it. As a consequence, the adversary can induce faulty results into the device and use them to recover the stored secret key. By using this approach we provide extremely efficient and practical cryptanalytic methods: by injecting n/2 + n2/32 faults we recover the n-bit secret key from a stream cipher based on cellular automaton rule 30. To the best of our knowledge this is the first application of fault attacks against cellular automata based stream ciphers.

APA, Harvard, Vancouver, ISO, and other styles

2

Arista-Jalife, Antonio, Eduardo Gomez-Ramirez, and Giovanni E. Pazienza. "Automatic implementation of totalistic cellular automata through polynomial cellular neural networks." In 2013 IEEE Workshop on Hybrid Intelligent Models and Applications (HIMA). IEEE, 2013. http://dx.doi.org/10.1109/hima.2013.6615018.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Ravichandran, Ramprasad, Nihal Ladiwala, Jean Nguyen, Mike Niemier, and Sung Kyu Lim. "Automatic cell placement for quantum-dot cellular automata." In Proceedins of the 14th ACM Great Lakes symposium. New York, New York, USA: ACM Press, 2004. http://dx.doi.org/10.1145/988952.989033.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Pires, A., D. P. Landau, and H. Herrmann. "Workshop on Computational Physics And Cellular Automata." In Workshop on Computational Physics and Cellular Automata. WORLD SCIENTIFIC, 1990. http://dx.doi.org/10.1142/9789814540940.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Perdang, J. M., and A. Lejeune. "Cellular Automata." In Workshop on Cellular Automata Models for Astrophysical Phenomena. WORLD SCIENTIFIC, 1993. http://dx.doi.org/10.1142/9789814535908.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Bie, Dongyang, Yanhe Zhu, JiZhuang Fan, Xiaolu Wang, Yu Zhang, and Jie Zhao. "A Bioinspired Approach Combining L-Systems and Cellular Automata for Distributed Self-Reconfiguration of UBot Modular Robotic Systems." In ASME 2016 Conference on Information Storage and Processing Systems. American Society of Mechanical Engineers, 2016. http://dx.doi.org/10.1115/isps2016-9539.

Full text

Abstract:

Self-reconfiguration of Modular Self-Reconfigurable (MSR) robots is a fundamental primitive that can be used as part of higher-lever functionality. The biological principle of self-organizing and growth in both animals and plants is learned to solve the automatic planning of configuration and control methods. A bioinspired approach is proposed for distributed self-reconfiguration. This method aims at utilizing the self-organization and pattern emergence of the MSR robotic system, which is made of large quantity of modules to promote the system to reconfigure in the direction of adapting to environments and tasks. This mechanism is hybrid by combining Lindenmayer systems (L-systems) and Cellular Automata (CA). L-systems are introduced for defining global structure and providing topological description. Cellular Automata (CA) handle motion planning of distributed modules. This method is absolutely distributed and convergent to self-adaptive structures with desired organizing principles. The convergence of proposed method is verified through simulations and experiments on UBot robots.

APA, Harvard, Vancouver, ISO, and other styles

7

Matic, Ivana D., Antonio Pedro Oliveira, and Amilcar Cardoso. "Automatic melody generation using Neural Networks and Cellular Automata." In 2012 11th Symposium on Neural Network Applications in Electrical Engineering (NEUREL 2012). IEEE, 2012. http://dx.doi.org/10.1109/neurel.2012.6419972.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Kapral, Raymond. "Discrete Dynamics of Spatio-Temporal Structures." In Nonlinear Dynamics in Optical Systems. Washington, D.C.: Optica Publishing Group, 1990. http://dx.doi.org/10.1364/nldos.1990.is9.

Full text

Abstract:

A heirarchy of discrete models for the description of spatio-temporal structures will be presented and applied to the study of specific physical systems. These models include classical cellular automata, coupled map lattices and lattice gas cellular automata.

APA, Harvard, Vancouver, ISO, and other styles

9

Andreica, Anca. "Cellular Automata Applications." In 2019 21st International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC). IEEE, 2019. http://dx.doi.org/10.1109/synasc49474.2019.00008.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Zhang, Chao, and Hessam S. Sarjoughian. "Cellular Automata DEVS." In SIMUTOOLS '17: 10th EAI International Conference on Simulation Tools and Techniques. New York, NY, USA: ACM, 2017. http://dx.doi.org/10.1145/3173519.3173534.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Cellullar automata"

1

Orhai, Max. Cellular Automata as Cellular Spaces. Portland State University Library, January 2014. http://dx.doi.org/10.15760/honors.90.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Meyer, David A. Knot Invariants and Cellular Automata. Fort Belvoir, VA: Defense Technical Information Center, May 1993. http://dx.doi.org/10.21236/ada264199.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Jen, E., R. Das, and C. E. Beasley. Particles and Patterns in Cellular Automata. Office of Scientific and Technical Information (OSTI), June 1999. http://dx.doi.org/10.2172/763243.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Dress, W. B., T. Zacharia, and B. Radhakrishnan. Cellular automata modeling of weld solidification structure. Office of Scientific and Technical Information (OSTI), December 1993. http://dx.doi.org/10.2172/244608.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Cenek, Martin. Information Processing in Two-Dimensional Cellular Automata. Portland State University Library, January 2000. http://dx.doi.org/10.15760/etd.275.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Johnson, Mark. Dynamic Scaling in Cellular Automata Simulations of Deposition Processes. Fort Belvoir, VA: Defense Technical Information Center, March 2000. http://dx.doi.org/10.21236/ada375200.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Crutchfield, J. P., and M. Mitchell. Evolving cellular automata to perform computations. Final technical report. Office of Scientific and Technical Information (OSTI), April 1998. http://dx.doi.org/10.2172/584960.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Meisel, Lawrence V., and Mark A. Johnson. Fractal Scaling in Cellular Automata Simulations of Dissipative Dynamical Systems. Fort Belvoir, VA: Defense Technical Information Center, July 1996. http://dx.doi.org/10.21236/ada315392.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Abarbanel, H., K. Case, A. Despain, F. Dyson, and M. Freeman. Cellular Automata and Parallel Processing for Practical Fluid-Dynamics Problems. Fort Belvoir, VA: Defense Technical Information Center, September 1990. http://dx.doi.org/10.21236/ada229234.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Fenwick, J. W., and L. J. Dowell. Electrical substation service-area estimation using Cellular Automata: An initial report. Office of Scientific and Technical Information (OSTI), July 1998. http://dx.doi.org/10.2172/319895.

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!