Siga este enlace para ver otros tipos de publicaciones sobre el tema: Cellular automata – Computer programs.

Artículos de revistas sobre el tema "Cellular automata – Computer programs"

Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros

Elija tipo de fuente:

Consulte los 50 mejores artículos de revistas para su investigación sobre el tema "Cellular automata – Computer programs".

Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.

También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.

Explore artículos de revistas sobre una amplia variedad de disciplinas y organice su bibliografía correctamente.

1

Skoneczny, Szymon. "Cellular automata-based modelling and simulation of biofilm structure on multi-core computers". Water Science and Technology 72, n.º 11 (14 de agosto de 2015): 2071–81. http://dx.doi.org/10.2166/wst.2015.426.

Texto completo
Resumen
The article presents a mathematical model of biofilm growth for aerobic biodegradation of a toxic carbonaceous substrate. Modelling of biofilm growth has fundamental significance in numerous processes of biotechnology and mathematical modelling of bioreactors. The process following double-substrate kinetics with substrate inhibition proceeding in a biofilm has not been modelled so far by means of cellular automata. Each process in the model proposed, i.e. diffusion of substrates, uptake of substrates, growth and decay of microorganisms and biofilm detachment, is simulated in a discrete manner. It was shown that for flat biofilm of constant thickness, the results of the presented model agree with those of a continuous model. The primary outcome of the study was to propose a mathematical model of biofilm growth; however a considerable amount of focus was also placed on the development of efficient algorithms for its solution. Two parallel algorithms were created, differing in the way computations are distributed. Computer programs were created using OpenMP Application Programming Interface for C ++ programming language. Simulations of biofilm growth were performed on three high-performance computers. Speed-up coefficients of computer programs were compared. Both algorithms enabled a significant reduction of computation time. It is important, inter alia, in modelling and simulation of bioreactor dynamics.
Los estilos APA, Harvard, Vancouver, ISO, etc.
2

Uragami, Daisuke y Yukio-Pegio Gunji. "2P463 Lattice-Driven Cellular Automata : Computer Simulation Model of Local Semantics(50. Non-equilibrium and complex system,Poster Session,Abstract,Meeting Program of EABS & BSJ 2006)". Seibutsu Butsuri 46, supplement2 (2006): S411. http://dx.doi.org/10.2142/biophys.46.s411_3.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
3

Sipper, Moshe. "Fifty Years of Research on Self-Replication: An Overview". Artificial Life 4, n.º 3 (julio de 1998): 237–57. http://dx.doi.org/10.1162/106454698568576.

Texto completo
Resumen
The study of artificial self-replicating structures or machines has been taking place now for almost half a century. My goal in this article is to present an overview of research carried out in the domain of self-replication over the past 50 years, starting from von Neumann's work in the late 1940s and continuing to the most recent research efforts. I shall concentrate on computational models, that is, ones that have been studied from a computer science point of view, be it theoretical or experimental. The systems are divided into four major classes, according to the model on which they are based: cellular automata, computer programs, strings (or strands), or an altogether different approach. With the advent of new materials, such as synthetic molecules and nanomachines, it is quite possible that we shall see this somewhat theoretical domain of study producing practical, real-world applications.
Los estilos APA, Harvard, Vancouver, ISO, etc.
4

Yañez, Osvaldo, Rodrigo Báez-Grez, Diego Inostroza, Walter A. Rabanal-León, Ricardo Pino-Rios, Jorge Garza y W. Tiznado. "AUTOMATON: A Program That Combines a Probabilistic Cellular Automata and a Genetic Algorithm for Global Minimum Search of Clusters and Molecules". Journal of Chemical Theory and Computation 15, n.º 2 (13 de diciembre de 2018): 1463–75. http://dx.doi.org/10.1021/acs.jctc.8b00772.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
5

Dennunzio, Alberto, Pierre Guillon y Benoît Masson. "Sand automata as cellular automata". Theoretical Computer Science 410, n.º 38-40 (septiembre de 2009): 3962–74. http://dx.doi.org/10.1016/j.tcs.2009.06.016.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
6

Bhardwaj, Rupali y Anil Upadhyay. "Cellular Automata". Journal of Organizational and End User Computing 29, n.º 1 (enero de 2017): 42–50. http://dx.doi.org/10.4018/joeuc.2017010103.

Texto completo
Resumen
Cellular automata (CA) are discrete dynamical systems consist of a regular finite grid of cell; each cell encapsulating an equal portion of the state, and arranged spatially in a regular fashion to form an n-dimensional lattice. A cellular automata is like computers, data represented by initial configurations which is processed by time evolution to produce output. This paper is an empirical study of elementary cellular automata which includes concepts of rule equivalence, evolution of cellular automata and classification of cellular automata. In addition, explanation of behaviour of cellular automata is revealed through example.
Los estilos APA, Harvard, Vancouver, ISO, etc.
7

Bandini, Stefania y Giancarlo Mauri. "Multilayered cellular automata". Theoretical Computer Science 217, n.º 1 (marzo de 1999): 99–113. http://dx.doi.org/10.1016/s0304-3975(98)00152-2.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
8

Kari, Jarkko, Ville Salo y Thomas Worsch. "Sequentializing cellular automata". Natural Computing 19, n.º 4 (1 de junio de 2019): 759–72. http://dx.doi.org/10.1007/s11047-019-09745-7.

Texto completo
Resumen
Abstract We study the problem of sequentializing a cellular automaton without introducing any intermediate states, and only performing reversible permutations on the tape. We give a decidable characterization of cellular automata which can be written as a single sweep of a bijective rule from left to right over an infinite tape. Such cellular automata are necessarily left-closing, and they move at least as much information to the left as they move information to the right.
Los estilos APA, Harvard, Vancouver, ISO, etc.
9

Stauffer, D. "Computer simulations of cellular automata". Journal of Physics A: Mathematical and General 24, n.º 5 (7 de marzo de 1991): 909–27. http://dx.doi.org/10.1088/0305-4470/24/5/007.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
10

Mayer, Gary R. y Hessam S. Sarjoughian. "Composable Cellular Automata". SIMULATION 85, n.º 11-12 (17 de julio de 2009): 735–49. http://dx.doi.org/10.1177/0037549709106341.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
11

Mairesse, Jean y Irène Marcovici. "Around probabilistic cellular automata". Theoretical Computer Science 559 (noviembre de 2014): 42–72. http://dx.doi.org/10.1016/j.tcs.2014.09.009.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
12

Kuske, Dietrich. "Weighted asynchronous cellular automata". Theoretical Computer Science 374, n.º 1-3 (abril de 2007): 127–48. http://dx.doi.org/10.1016/j.tcs.2006.11.031.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
13

Toole, Jameson y Scott E. Page. "Predicting Cellular Automata". Complex Systems 19, n.º 4 (15 de diciembre de 2010): 343–62. http://dx.doi.org/10.25088/complexsystems.19.4.343.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
14

Phan, Victor Duy. "Commutative Cellular Automata". Complex Systems 25, n.º 1 (15 de marzo de 2016): 23–38. http://dx.doi.org/10.25088/complexsystems.25.1.23.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
15

Di Lena, Pietro y Luciano Margara. "Nondeterministic Cellular Automata". Information Sciences 287 (diciembre de 2014): 13–25. http://dx.doi.org/10.1016/j.ins.2014.07.007.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
16

Gavrilov, S. V., I. V. Matyushkin y A. L. Stempkovsky. "Computability via Cellular Automata". Scientific and Technical Information Processing 44, n.º 5 (diciembre de 2017): 314–28. http://dx.doi.org/10.3103/s0147688217050057.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
17

Dantchev, S. "Dynamic Neighbourhood Cellular Automata". Computer Journal 54, n.º 1 (28 de marzo de 2009): 26–30. http://dx.doi.org/10.1093/comjnl/bxp019.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
18

Adamides, E. D., Ph Tsalides y A. Thanailakis. "Hierarchical cellular automata structures". Parallel Computing 18, n.º 5 (mayo de 1992): 517–24. http://dx.doi.org/10.1016/0167-8191(92)90087-n.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
19

Onsted, Jeffrey A. y Keith C. Clarke. "Forecasting Enrollment in Differential Assessment Programs Using Cellular Automata". Environment and Planning B: Planning and Design 38, n.º 5 (octubre de 2011): 829–49. http://dx.doi.org/10.1068/b37010.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
20

Beros, Achilles, Monique Chyba y Oleksandr Markovichenko. "Controlled cellular automata". Networks & Heterogeneous Media 14, n.º 1 (2019): 1–22. http://dx.doi.org/10.3934/nhm.2019001.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
21

Klein, Andreas y Martin Kutrib. "Fast one-way cellular automata". Theoretical Computer Science 295, n.º 1-3 (febrero de 2003): 233–50. http://dx.doi.org/10.1016/s0304-3975(02)00406-1.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
22

Sutner, K. "Cellular automata and intermediate degrees". Theoretical Computer Science 296, n.º 2 (marzo de 2003): 365–75. http://dx.doi.org/10.1016/s0304-3975(02)00661-8.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
23

Gajardo, A., V. Nesme y G. Theyssier. "Pre-expansivity in cellular automata". Theoretical Computer Science 816 (mayo de 2020): 37–66. http://dx.doi.org/10.1016/j.tcs.2019.10.034.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
24

Dürr, Christoph, Ivan Rapaport y Guillaume Theyssier. "Cellular automata and communication complexity". Theoretical Computer Science 322, n.º 2 (agosto de 2004): 355–68. http://dx.doi.org/10.1016/j.tcs.2004.03.017.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
25

Terrier, Véronique. "Closure properties of cellular automata". Theoretical Computer Science 352, n.º 1-3 (marzo de 2006): 97–107. http://dx.doi.org/10.1016/j.tcs.2005.10.039.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
26

Kutrib, Martin y Andreas Malcher. "Cellular automata with sparse communication". Theoretical Computer Science 411, n.º 38-39 (agosto de 2010): 3516–26. http://dx.doi.org/10.1016/j.tcs.2010.05.024.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
27

Eckart, J. Dana. "A cellular automata simulation system". ACM SIGPLAN Notices 26, n.º 8 (agosto de 1991): 80–85. http://dx.doi.org/10.1145/122598.122606.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
28

Eckart, J. Dana. "A cellular automata simulation system". ACM SIGPLAN Notices 27, n.º 8 (agosto de 1992): 99–106. http://dx.doi.org/10.1145/142137.142164.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
29

Terrier, Véronique. "Two-dimensional cellular automata and deterministic on-line tessalation automata". Theoretical Computer Science 301, n.º 1-3 (mayo de 2003): 167–86. http://dx.doi.org/10.1016/s0304-3975(02)00575-3.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
30

Cios, Krzysztof. "Identification of cellular automata". Neurocomputing 10, n.º 2 (marzo de 1996): 207–8. http://dx.doi.org/10.1016/s0925-2312(96)90050-8.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
31

Zupanc, Jernej y Bogdan Filipi�. "Evolutionary Synthesis of Cellular Automata". Journal of Computing and Information Technology 19, n.º 2 (2011): 105. http://dx.doi.org/10.2498/cit.1001419.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
32

Dennunzio, Alberto y Enrico Formenti. "Foreword: cellular automata and applications". Natural Computing 12, n.º 3 (16 de mayo de 2013): 305. http://dx.doi.org/10.1007/s11047-013-9377-6.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
33

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

Texto completo
Resumen
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.
Los estilos APA, Harvard, Vancouver, ISO, etc.
34

Cheremisinov, D. I. "Synthesis of computer programs that implement finite automata". Automatic Control and Computer Sciences 41, n.º 4 (agosto de 2007): 215–23. http://dx.doi.org/10.3103/s0146411607040050.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
35

Esnaashari, Mehdi y Mohammad Reza Meybodi. "Irregular Cellular Learning Automata". IEEE Transactions on Cybernetics 45, n.º 8 (agosto de 2015): 1622–32. http://dx.doi.org/10.1109/tcyb.2014.2356591.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
36

KRITHIVASAN, KAMALA y MEENA MAHAJAN. "SYSTOLIC PYRAMID AUTOMATA, CELLULAR AUTOMATA AND ARRAY LANGUAGES". International Journal of Pattern Recognition and Artificial Intelligence 03, n.º 03n04 (diciembre de 1989): 405–33. http://dx.doi.org/10.1142/s0218001489000310.

Texto completo
Resumen
Systolic pyramid automata accepting square arrays are defined. Homogeneous and semi-homogeneous pyramid automata are shown to have equal power though regular pyramid automata are more powerful. Languages accepted by these automata are compared with languages generated by array grammars and languages accepted by one-way 2-D cellular automata. Hexagonal pyramid automata are also considered and are shown to accept some languages generated by hexagonal array grammars.
Los estilos APA, Harvard, Vancouver, ISO, etc.
37

Worsch, Thomas. "Simulation of cellular automata". Future Generation Computer Systems 16, n.º 2-3 (diciembre de 1999): 157–70. http://dx.doi.org/10.1016/s0167-739x(99)00044-8.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
38

Lakshtanov, E. L. y E. S. Langvagen. "Entropy of multidimensional cellular automata". Problems of Information Transmission 42, n.º 1 (enero de 2006): 38–45. http://dx.doi.org/10.1134/s0032946006010042.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
39

Bartosik, Łukasz, Janusz Stafiej y Dung Di Caprio. "Cellular automata model of anodization". Journal of Computational Science 11 (noviembre de 2015): 309–16. http://dx.doi.org/10.1016/j.jocs.2015.06.003.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
40

Misra, Susanta, Aloke K. Das, Dipanwita Roy Chowdhury y P. Pal Chaudhuri. "Cellular Automata—Theory and Applications". IETE Journal of Research 36, n.º 3-4 (mayo de 1990): 251–59. http://dx.doi.org/10.1080/03772063.1990.11436890.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
41

Martin, Bruno. "Embedding Torus Automata into a Ring of Automata". International Journal of Foundations of Computer Science 08, n.º 04 (diciembre de 1997): 425–31. http://dx.doi.org/10.1142/s0129054197000264.

Texto completo
Resumen
In this paper, we deal with two-dimensional cellular automata. Our goal is to present a linear space and sub-linear time algorithm to embed a bounded finite torus, considered as a cellular space, into a ring of automata. Such an embedding has to preserve the neighborhood of the cells and to keep the periodicities of the torus. Finally, we generalize this result to torus of greater dimension.
Los estilos APA, Harvard, Vancouver, ISO, etc.
42

Kita, E. y T. Toyoda. "Structural design using cellular automata". Structural and Multidisciplinary Optimization 19, n.º 1 (17 de marzo de 2000): 64–73. http://dx.doi.org/10.1007/s001580050086.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
43

Dubacq, J. C., B. Durand y E. Formenti. "Kolmogorov complexity and cellular automata classification". Theoretical Computer Science 259, n.º 1-2 (mayo de 2001): 271–85. http://dx.doi.org/10.1016/s0304-3975(00)00012-8.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
44

Durand, Bruno, Enrico Formenti y Zsuzsanna Róka. "Number-conserving cellular automata I: decidability". Theoretical Computer Science 299, n.º 1-3 (abril de 2003): 523–35. http://dx.doi.org/10.1016/s0304-3975(02)00534-0.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
45

Formenti, Enrico y Aristide Grange. "Number conserving cellular automata II: dynamics". Theoretical Computer Science 304, n.º 1-3 (julio de 2003): 269–90. http://dx.doi.org/10.1016/s0304-3975(03)00134-8.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
46

Bunimovich, L. A. y D. M. Kreslavskiy. "Lorentz gas cellular automata on graphs". Theoretical Computer Science 306, n.º 1-3 (septiembre de 2003): 195–221. http://dx.doi.org/10.1016/s0304-3975(03)00278-0.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
47

Mazoyer, Jacques y Véronique Terrier. "Signals in one-dimensional cellular automata". Theoretical Computer Science 217, n.º 1 (marzo de 1999): 53–80. http://dx.doi.org/10.1016/s0304-3975(98)00150-9.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
48

Sutner, K. "The complexity of reversible cellular automata". Theoretical Computer Science 325, n.º 2 (octubre de 2004): 317–28. http://dx.doi.org/10.1016/j.tcs.2004.06.011.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
49

Kari, Jarkko. "Theory of cellular automata: A survey". Theoretical Computer Science 334, n.º 1-3 (abril de 2005): 3–33. http://dx.doi.org/10.1016/j.tcs.2004.11.021.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
50

Ceccherini-Silberstein, Tullio, Michel Coornaert, Francesca Fiorenzi y Zoran Šunić. "Cellular automata between sofic tree shifts". Theoretical Computer Science 506 (septiembre de 2013): 79–101. http://dx.doi.org/10.1016/j.tcs.2013.07.007.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
Ofrecemos descuentos en todos los planes premium para autores cuyas obras están incluidas en selecciones literarias temáticas. ¡Contáctenos para obtener un código promocional único!

Pasar a la bibliografía