Zaloguj się

Gotowe bibliografie tematyczne / Cellular automata / Artykuły w czasopismach

Artykuły w czasopismach na temat „Cellular automata”

Kliknij ten link, aby zobaczyć inne rodzaje publikacji na ten temat: Cellular automata.

Autor: Grafiati

Data publikacji: 4 czerwca 2021

Data aktualizacji: 1 sierpnia 2024

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Sprawdź 50 najlepszych artykułów w czasopismach naukowych na temat „Cellular automata”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Przeglądaj artykuły w czasopismach z różnych dziedzin i twórz odpowiednie bibliografie.

1

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

Pełny tekst źródła

Streszczenie:

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.

Style APA, Harvard, Vancouver, ISO itp.

2

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

3

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

Pełny tekst źródła

Streszczenie:

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.

Style APA, Harvard, Vancouver, ISO itp.

4

Jung, Goeun, i 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, nr 1 (30.04.2021): 139–52. http://dx.doi.org/10.25202/jakg.10.1.9.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

5

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

Pełny tekst źródła

Streszczenie:

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.

Style APA, Harvard, Vancouver, ISO itp.

6

Hasanzadeh Mofrad, Mohammad, Sana Sadeghi, Alireza Rezvanian i Mohammad Reza Meybodi. "Cellular edge detection: Combining cellular automata and cellular learning automata". AEU - International Journal of Electronics and Communications 69, nr 9 (wrzesień 2015): 1282–90. http://dx.doi.org/10.1016/j.aeue.2015.05.010.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

7

BEIGY, HAMID, i M. R. MEYBODI. "OPEN SYNCHRONOUS CELLULAR LEARNING AUTOMATA". Advances in Complex Systems 10, nr 04 (grudzień 2007): 527–56. http://dx.doi.org/10.1142/s0219525907001264.

Pełny tekst źródła

Streszczenie:

Cellular learning automata is a combination of learning automata and cellular automata. This model is superior to cellular learning automata because of its ability to learn and also is superior to single learning automaton because it is a collection of learning automata which can interact together. In some applications such as image processing, a type of cellular learning automata in which the action of each cell in the next stage of its evolution not only depends on the local environment (actions of its neighbors) but it also depends on the external environments. We call such a cellular learning automata as open cellular learning automata. In this paper, we introduce open cellular learning automata and then study its steady state behavior. It is shown that for a class of rules called commutative rules, the open cellular learning automata in stationary external environments converges to a stable and compatible configuration. Then the application of this new model to image segmentation has been presented.

Style APA, Harvard, Vancouver, ISO itp.

8

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

Pełny tekst źródła

Streszczenie:

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.

Style APA, Harvard, Vancouver, ISO itp.

9

Bandini, S. "Cellular automata". Future Generation Computer Systems 18, nr 7 (sierpień 2002): v—vi. http://dx.doi.org/10.1016/s0167-739x(02)00067-5.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

10

Kutrib, Martin, Roland Vollmar i Thomas Worsch. "Cellular automata". Parallel Computing 23, nr 11 (listopad 1997): 1565. http://dx.doi.org/10.1016/s0167-8191(97)82081-9.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

11

Gasanov, Elyar Eldarovich. "Cellular automata with locators". Mathematical Problems of Cybernetics, nr 21 (2023): 5–51. http://dx.doi.org/10.20948/mvk-2023-5.

Pełny tekst źródła

Streszczenie:

The article introduces a new mathematical object - a cellular automaton with locators. It is obtained by adding a new feature to the cellular automaton - send signals to the «ether» and receive from the «ether» the total signal of all elementary automata. The work is of an overview nature. It gives the history of the emergence of the concept of a cellular automaton with locators and describes the results obtained in this area.

Style APA, Harvard, Vancouver, ISO itp.

12

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

Pełny tekst źródła

Streszczenie:

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.

Style APA, Harvard, Vancouver, ISO itp.

13

Schöfisch, B., i K. P. Hadeler. "Dimer automata and cellular automata". Physica D: Nonlinear Phenomena 94, nr 4 (lipiec 1996): 188–204. http://dx.doi.org/10.1016/0167-2789(96)00039-5.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

14

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

15

BEIGY, HAMID, i M. R. MEYBODI. "A MATHEMATICAL FRAMEWORK FOR CELLULAR LEARNING AUTOMATA". Advances in Complex Systems 07, nr 03n04 (wrzesień 2004): 295–319. http://dx.doi.org/10.1142/s0219525904000202.

Pełny tekst źródła

Streszczenie:

The cellular learning automata, which is a combination of cellular automata, and learning automata, is a new recently introduced model. This model is superior to cellular automata because of its ability to learn and is also superior to a single learning automaton because it is a collection of learning automata which can interact with each other. The basic idea of cellular learning automata, which is a subclass of stochastic cellular learning automata, is to use the learning automata to adjust the state transition probability of stochastic cellular automata. In this paper, we first provide a mathematical framework for cellular learning automata and then study its convergence behavior. It is shown that for a class of rules, called commutative rules, the cellular learning automata converges to a stable and compatible configuration. The numerical results also confirm the theoretical investigations.

Style APA, Harvard, Vancouver, ISO itp.

16

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

17

DOLZHENKO, EGOR, i NATAŠA JONOSKA. "TWO-DIMENSIONAL LANGUAGES AND CELLULAR AUTOMATA". International Journal of Foundations of Computer Science 23, nr 01 (styczeń 2012): 185–206. http://dx.doi.org/10.1142/s0129054112500037.

Pełny tekst źródła

Streszczenie:

Space-time diagrams of a one-dimensional cellular automaton can be visualized as half-plane arrays of symbols. The set of rectangular blocks extracted from such arrays forms a two-dimensional (picture) language. We initiate a study of cellular automata through the associated two dimensional languages by investigating cellular automata whose two-dimensional languages are factorial-local. We show that these cellular automata have the same characterization as one-sided cellular automata with SFT traces.

Style APA, Harvard, Vancouver, ISO itp.

18

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

Pełny tekst źródła

Streszczenie:

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.

Style APA, Harvard, Vancouver, ISO itp.

19

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

Pełny tekst źródła

Streszczenie:

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

Style APA, Harvard, Vancouver, ISO itp.

20

Das, Sukanta, i Mihir K. Chakraborty. "Formal Logic of Cellular Automata". Complex Systems 30, nr 2 (15.06.2021): 187–203. http://dx.doi.org/10.25088/complexsystems.30.2.187.

Pełny tekst źródła

Streszczenie:

This paper develops a formal logic, named L CA , targeting modeling of one-dimensional binary cellular automata. We first develop the syntax of L CA , then give semantics to L CA in the domain of all binary strings. Then the elementary cellular automata and four-neighborhood binary cellular automata are shown as models of the logic. These instances point out that there are other models of L CA . Finally it is proved that any one-dimensional binary cellular automaton is a model of the proposed logic.

Style APA, Harvard, Vancouver, ISO itp.

21

Sutner, Klaus. "Linear cellular automata and Fischer automata". Parallel Computing 23, nr 11 (listopad 1997): 1613–34. http://dx.doi.org/10.1016/s0167-8191(97)00080-x.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

22

Pighizzini, Giovanni. "Asynchronous automata versus asynchronous cellular automata". Theoretical Computer Science 132, nr 1-2 (wrzesień 1994): 179–207. http://dx.doi.org/10.1016/0304-3975(94)90232-1.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

23

Kozlov, Valery, Alexander Tatashev i Marina Yashina. "Elementary Cellular Automata as Invariant under Conjugation Transformation or Combination of Conjugation and Reflection Transformations, and Applications to Traffic Modeling". Mathematics 10, nr 19 (28.09.2022): 3541. http://dx.doi.org/10.3390/math10193541.

Pełny tekst źródła

Streszczenie:

This paper develops the analysis of properties of the cellular automata class introduced by the authors. It is assumed that the set of automaton cells is finite and forms a closed lattice, and there are two states for each automaton cell. We consider a new concept. This concept is the average velocity of a cellular automaton, which characterizes the average intensity of changes in the states of the automaton’s cells for a given initial state. The automaton velocity is equal to 1 if the state of any cell changes at each step. The spectrum of average velocities of a cellular automaton is the set of average velocities for different initial states. Since the state space is finite, the automaton, starting from a certain moment of time, is in periodically repeating states of a cycle, and thus, the research of the velocity spectrum is related to the problem of studying the set of the automaton cycles. For elementary cellular automata, the introduced class consists of a subclass of automata such that the conjugation trasformation of an automaton is the automaton itself (Subclass A) or the reflection of the automaton (Subclass B). For this class, it is proved that the spectrum of the automaton contains the value v0 if and only if the spectrum of the complementary automaton contains the value 1−v0 (the sum of the index of elementary cellular automaton and the complementary automaton is 255). For automata of Subclasses A and B, the set of cycles and the velocity spectrum are studied. For Subclass A, a theorem has been proved such that in accordance with this theorem, if two automata complementary to each other start evolving in the same initial state, then the sum of their average velocities is equal to 1. This theorem for Subclass A is generalized to cellular automata, invariant under the conjugation transformation, of more general type than elementary automata. Generalizations of the theorem have been given for the class of one-dimensional cellular automata with a neighborhood containing 2r+1 cells (the next state of the cell depends on the present states of this cell, r cells on the left and r cells on the right) and for some traditionally considered classes of two-dimensional automata. Some elementary cellular automata belonging to the class considered in the paper can be interpreted as transport models. The properties of the spectra for these automata are studied and compared with the properties of elementary cellular automata not invariant under the considered transformations and can also be interpreted as transport models. The analytical results obtained for these simple models can be used to study the qualitative properties and limiting behavior of more complex transport models.

Style APA, Harvard, Vancouver, ISO itp.

24

OKAYAMA, Tsuyoshi, i Haruhiko MURASE. "Leaf Cellular Automata." Shokubutsu Kojo Gakkaishi 14, nr 3 (2002): 152–56. http://dx.doi.org/10.2525/jshita.14.152.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

25

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

26

Bolognesi, Tommaso, i Vincenzo Ciancia. "Nominal Cellular Automata". Electronic Proceedings in Theoretical Computer Science 223 (10.08.2016): 24–35. http://dx.doi.org/10.4204/eptcs.223.2.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

27

Nobe, Atsushi, i Fumitaka Yura. "Linearizable cellular automata". Journal of Physics A: Mathematical and Theoretical 40, nr 26 (12.06.2007): 7159–74. http://dx.doi.org/10.1088/1751-8113/40/26/004.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

28

Agapie, Alexandru, Anca Andreica i Marius Giuclea. "Probabilistic Cellular Automata". Journal of Computational Biology 21, nr 9 (wrzesień 2014): 699–708. http://dx.doi.org/10.1089/cmb.2014.0074.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

29

Mayer, Gary R., i Hessam S. Sarjoughian. "Composable Cellular Automata". SIMULATION 85, nr 11-12 (17.07.2009): 735–49. http://dx.doi.org/10.1177/0037549709106341.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

30

Stauffer, Dietrich. "Programming Cellular Automata". Computers in Physics 5, nr 1 (1991): 62. http://dx.doi.org/10.1063/1.4822970.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

31

Maddox, John. "Mechanizing cellular automata". Nature 321, nr 6066 (maj 1986): 107. http://dx.doi.org/10.1038/321107a0.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

32

Lent, C. S., P. D. Tougaw, W. Porod i G. H. Bernstein. "Quantum cellular automata". Nanotechnology 4, nr 1 (1.01.1993): 49–57. http://dx.doi.org/10.1088/0957-4484/4/1/004.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

33

KOKOLAKIS, I., I. ANDREADIS i PH TSALIDES. "PROGRAMMABLE CELLULAR AUTOMATA". Journal of Circuits, Systems and Computers 09, nr 05n06 (październik 1999): 255–60. http://dx.doi.org/10.1142/s0218126699000219.

Pełny tekst źródła

Streszczenie:

A new architecture of the binary cellular automata (CA), called programmable CA (PCA), is presented for the first time in this letter. The basic properties of the PCA are also studied. The proposed architecture is simple and fast and aims at providing efficient solutions to a variety of CA applications.

Style APA, Harvard, Vancouver, ISO itp.

34

Kornyak, V. V. "Symmetric cellular automata". Programming and Computer Software 33, nr 2 (marzec 2007): 87–93. http://dx.doi.org/10.1134/s0361768807020065.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

35

Moore, Cristopher. "Quasilinear cellular automata". Physica D: Nonlinear Phenomena 103, nr 1-4 (kwiecień 1997): 100–132. http://dx.doi.org/10.1016/s0167-2789(96)00255-2.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

36

Fricke, Thomas. "Stochastic cellular automata". Nonlinear Analysis: Theory, Methods & Applications 30, nr 3 (grudzień 1997): 1847–58. http://dx.doi.org/10.1016/s0362-546x(96)00378-1.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

37

Kutrib, Martin. "Pushdown cellular automata". Theoretical Computer Science 215, nr 1-2 (luty 1999): 239–61. http://dx.doi.org/10.1016/s0304-3975(97)00187-4.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

38

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

39

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

40

Jadur, Camilo, Masakazu Nasu i Jorge Yazlle. "Permutation Cellular Automata". Acta Applicandae Mathematicae 126, nr 1 (4.04.2013): 203–43. http://dx.doi.org/10.1007/s10440-013-9814-7.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

41

Fokas, A. S., E. P. Papadopoulou i Y. G. Saridakis. "Soliton cellular automata". Physica D: Nonlinear Phenomena 41, nr 3 (kwiecień 1990): 297–321. http://dx.doi.org/10.1016/0167-2789(90)90001-6.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

42

Montgomery, David, i Gary D. Doolen. "Magnetohydrodynamic cellular automata". Physics Letters A 120, nr 5 (luty 1987): 229–31. http://dx.doi.org/10.1016/0375-9601(87)90214-3.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

43

Kaneko, Kunihiko. "Symplectic cellular automata". Physics Letters A 129, nr 1 (maj 1988): 9–16. http://dx.doi.org/10.1016/0375-9601(88)90464-1.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

44

Toole, Jameson, i Scott E. Page. "Predicting Cellular Automata". Complex Systems 19, nr 4 (15.12.2010): 343–62. http://dx.doi.org/10.25088/complexsystems.19.4.343.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

45

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

46

Milošević, M. V., G. R. Berdiyorov i F. M. Peeters. "Fluxonic cellular automata". Applied Physics Letters 91, nr 21 (19.11.2007): 212501. http://dx.doi.org/10.1063/1.2813047.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

47

Hatori, Tadatsugu. "Magnetohydrodynamic Cellular Automata". Progress of Theoretical Physics Supplement 99 (1989): 229–43. http://dx.doi.org/10.1143/ptps.99.229.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

48

Bruschi, M., P. M. Santini i O. Ragnisco. "Integrable cellular automata". Physics Letters A 169, nr 3 (wrzesień 1992): 151–60. http://dx.doi.org/10.1016/0375-9601(92)90585-a.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

49

Jen, Erica. "Cylindrical cellular automata". Communications in Mathematical Physics 118, nr 4 (grudzień 1988): 569–90. http://dx.doi.org/10.1007/bf01221109.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

50

Takahashi, Satoshi. "Cellular automata and multifractals: Dimension spectra of linear cellular automata". Physica D: Nonlinear Phenomena 45, nr 1-3 (wrzesień 1990): 36–48. http://dx.doi.org/10.1016/0167-2789(90)90172-l.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!