Log in

Relevant bibliographies by topics / Cellular automata – Computer programs / Journal articles

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

Journal articles on the topic 'Cellular automata – Computer programs'

Author: Grafiati

Published: 4 June 2021

Last updated: 1 February 2022

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

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Cellular automata – Computer programs.'

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 journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

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

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

2

Uragami, Daisuke, and 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.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

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

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

4

Yañez, Osvaldo, Rodrigo Báez-Grez, Diego Inostroza, Walter A. Rabanal-León, Ricardo Pino-Rios, Jorge Garza, and 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, no. 2 (December 13, 2018): 1463–75. http://dx.doi.org/10.1021/acs.jctc.8b00772.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

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

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

7

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

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

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

9

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Toole, Jameson, and Scott E. Page. "Predicting Cellular Automata." Complex Systems 19, no. 4 (December 15, 2010): 343–62. http://dx.doi.org/10.25088/complexsystems.19.4.343.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

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

34

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

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

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

37

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

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

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

42

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

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

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!