40,304 Hits in 4.4 sec

Periods and clusters in Ising cellular automata

H J Hermann, H O Carmesin, D Stauffer
1987 Journal of Physics A: Mathematical and General  
The dynamic properties of Q2R cellular automata for the Ising model are studied numerically on the square lattice, with particular emphasis on the periods observed for single spins, clusters of neighbouring  ...  We find some numerical indications for a 'cluster-period critical point' at a temperature below the Curie temperature of the Ising magnet.  ...  Introduction In cellular automata the change in each variable for every time step depends in a simple and predictable way on the current values of the variable in the neighbouring cells of the lattice  ... 
doi:10.1088/0305-4470/20/14/031 fatcat:xe4ml73rtjfh3gh7laiaz5sari

Evolutionary Turing in the Context of Evolutionary Machines [article]

Mark Burgin, Eugene Eberbach
2013 arXiv   pre-print
To achieve this goal, we develop a general approach to evolutionary processes in the computational context, building mathematical models of computational systems, functioning of which is based on evolutionary  ...  evolutionary machines to conventional automata, such as finite automata or Turing machines.  ...  General periodic evolutionary finite automata have more accepting power than basic periodic evolutionary finite automata and than finite automata.  ... 
arXiv:1304.3762v1 fatcat:52oz3b6c4nfdbp6icgultpzfpq

Page 3382 of Mathematical Reviews Vol. , Issue 92f [page]

1992 Mathematical Reviews  
Special emphasis is given to the class of periodic automata.  ...  The results deal with decompositions and periodic representations of finite automata approximating cyclic sequences generated by finite and infinite linear shift registers.  ... 

Page 1169 of Mathematical Reviews Vol. , Issue 84c [page]

1984 Mathematical Reviews  
1169 68D Automata Author’s summary: “This work deals extensively with structural properties of generalized periodic sums of finite automata.  ...  A class of input subautomata, in particular a class of subautomata associated with the change of operating time, is also considered from the point of view of generalized periodic sums and generalized extensions  ... 

On complex dynamics from reversible cellular automata [article]

Juan Carlos Seck-Tuoh-Mora, Genaro J. Martinez, Norberto Hernandez-Romero, Joselito Medina-Marin, Irving Barragan-Vite
2020 arXiv   pre-print
The relevance of this paper is to present that reversibility can be a useful structure to implement complex behaviors in cellular automata.  ...  Experimental results show that complexity can be obtained from reversible cellular automata appending a proportion of about two times more states at random than the original number of states in the reversible  ...  This process can generate extended cellular automata with periodic backgrounds and interacting particles.  ... 
arXiv:2009.09122v1 fatcat:uqhpf7ktxfccretsdhjxswl5cy

Research of Complex Forms in Cellular Automata by Evolutionary Algorithms [chapter]

Emmanuel Sapin, Olivier Bailleux, Jean-Jacques Chabrier
2004 Lecture Notes in Computer Science  
Two evolutionary algorithms are used: the first one discovers rules supporting gliders and periodic patterns, and the second one discovers glider guns in cellular automata.  ...  The results are a step toward the general simulation of Boolean circuits by this automaton and show that the evolutionary approach is a promising technic for searching for cellular automata that support  ...  Later on, our aim will be the use of evolutionary algorithm for the search of new universal automata.  ... 
doi:10.1007/978-3-540-24621-3_29 fatcat:sdvmbetrundopanwgptqajgguu

Real-Time Extended Interface Automata for Software Testing Cases Generation

Shunkun Yang, Jiaqi Xu, Tianlong Man, Bin Liu
2014 The Scientific World Journal  
Detailed definitions of the RTEIA and the testing cases generation algorithm are provided in this paper.  ...  This paper presents the real-time extended interface automata (RTEIA) which adds clearer and more detailed temporal information description by the application of time words.  ...  . 302367), the National Pre-Research Foundation of China (no. 51319080201), and YETP1121.  ... 
doi:10.1155/2014/731041 pmid:24892080 pmcid:PMC4032670 fatcat:w463bfgggbe3fmb7vet7qazwsa

Evolutionary Information Theory

Mark Burgin
2013 Information  
We denote the class of all almost periodic general evolutionary K-machines by APGEAK. 5.  ...  At the end of the paper, directions for future research are suggested. Q contains all almost periodic sequences, we have almost periodic general evolutionary K-machines.  ...  evolutionary automata in PGEAK; (b) If the class K has universal automata in K and a finitary coding, then the class PGEAK 1 of all periodic general evolutionary automata in GEAK with the period 1 also  ... 
doi:10.3390/info4020124 fatcat:fe6voo5onbhpvpa5ofz2iyebpq

Page 1491 of Mathematical Reviews Vol. 58, Issue 2 [page]

1979 Mathematical Reviews  
Mikolajczak, Boleslaw 58 #9921 On the structure of cyclic automata and their generalized periodic sums. Found. Control Engrg. 3 (1978), no. 1, 9-17.  ...  The operation of periodic sum of finite automata, which leads to a class of time-varying automata, is considered.  ... 

Random Expansion Method for the Generation of Complex Cellular Automata [article]

Juan Carlos Seck-Tuoh-Mora, Norberto Hernandez-Romero, Joselito Medina-Marin, Genaro J. Martinez, Irving Barragan-Vite
2020 arXiv   pre-print
The emergence of complex behaviors in cellular automata is an area that has been widely developed in recent years with the intention to generate and analyze automata that produce space-moving patterns  ...  In this study, the specification of cellular automata with complex behaviors was obtained by utilizing randomly generated specimens.  ...  These automata serve as support for generating a periodic background on which the random extensions on the said automata are capable of generating gliders.  ... 
arXiv:2009.09515v1 fatcat:qteeju7ya5cvteqcsreirdmyem

Page 1220 of Mathematical Reviews Vol. 57, Issue 3 [page]

1979 Mathematical Reviews  
In the paper a special operation over finite automata, namely periodic sum of finite automata, is considered.  ...  The relations between automorphisms of finite automata and their periodic sum are investigated in detail. Jerzy W.  ... 

Specification of Embedded Control Systems Behaviour Using Actor Interface Automata [chapter]

Christo Angelov, Feng Zhou, Krzysztof Sierszecki
2010 Lecture Notes in Computer Science  
The paper presents an operational specification of DTM in terms of actor interface automata, whereby a distributed control system is modeled as a set of communicating interface automata executing distributed  ...  It has also implications for system analysis, since actor interface automata are essentially timed automata that can be used as analysis models in model checking tools and simulation environments.  ...  In case of deadline violation, it generates the corresponding exception signal.  ... 
doi:10.1007/978-3-642-16256-5_17 fatcat:itrr2hzrizgv3lgeiqhux6eic4

Permutive One-Way Cellular Automata and the Finiteness Problem for Automaton Groups [chapter]

Martin Delacourt, Nicolas Ollinger
2017 Lecture Notes in Computer Science  
We connect this question of algebraic nature to the periodicity problem of one-way cellular automata, a dynamical question known to be undecidable in the general case.  ...  We provide a rst undecidability result on the dynamics of one-way permutive cellular automata, arguing in favor of the undecidability of the niteness problem for reset Mealy automata.  ...  The status of the periodicity problem remains open for one-way cellular automata.  ... 
doi:10.1007/978-3-319-58741-7_23 fatcat:nu7u7bhvh5f5hbwnt26j5ar5pe

Page 1576 of Mathematical Reviews Vol. , Issue 80D [page]

1980 Mathematical Reviews  
Author’s summary: “In this paper two kinds of generalization of the notion of extension and periodic sum are considered.  ...  The conditions for the extensions and periodic sums to be isomorphic in this generalized sense are considered.  ... 

Page 8 of Behavioral Science Vol. 6, Issue 1 [page]

1961 Behavioral Science  
ANALYSIS AND SYNTHESIS OFAUTOMATA The discussion of automata in Sections t and 5 will presuppose some knowledge of fixed automata and generalized Turing ma- chines, and so we will mention briefly some  ...  we will discuss in the present section may be extended to cover automata generally.  ... 
« Previous Showing results 1 — 15 out of 40,304 results