Results 21 to 30 of about 8,845 (199)
Post-surjectivity and balancedness of cellular automata over groups [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 We discuss cellular automata over arbitrary finitely generated groups. We call a cellular automaton post-surjective if for any pair of asymptotic configurations, every pre-image of one is asymptotic to a pre-image of the other.
Silvio Capobianco +2 more
doaj +1 more source
Cellular Automata are Generic [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 Any algorithm (in the sense of Gurevich's abstract-state-machine axiomatization of classical algorithms) operating over any arbitrary unordered domain can be simulated by a dynamic cellular automaton, that is, by a pattern-directed cellular automaton ...
Nachum Dershowitz, Evgenia Falkovich
doaj +1 more source
Transductions Computed by One-Dimensional Cellular Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 Cellular automata are investigated towards their ability to compute transductions, that is, to transform inputs into outputs. The families of transductions computed are classified with regard to the time allowed to process the input and to compute the ...
Martin Kutrib, Andreas Malcher
doaj +1 more source
Cellular automaton-based simulation of bulk stacking and recovery
Journal of Materials Research and Technology, 2022 Stockpiling is a key issue in bulk material handling. A small-scale, quasi-two-dimensional physical model was used to investigate size segregation during stacking and gravitational reclaim of stockpiles and to compare experimental results to those ones ...
Matheus Henrique de Castro +2 more
doaj +1 more source
Fracture and Structural Integrity, 2013 An approach to multiscale description of deformation and fracture of brittle porous materials on the basis of movable cellular automaton method was proposed.
Ig. S. Konovalenko +2 more
doaj +3 more sources
A cellular automaton for blocking queen games [PDF]
Natural Computing, 2015 We show that the winning positions of a certain type of two-player game form interesting patterns which often defy analysis, yet can be computed by a cellular automaton. The game, known as {\em Blocking Wythoff Nim}, consists of moving a queen as in chess, but always towards (0,0), and it may not be moved to any of $k-1$ temporarily "blocked" positions
Matthew Cook 0001 +2 more
openaire +5 more sources
Simulation tools: formal language for cellular automatons behavior description
Adaptivni Sistemi Avtomatičnogo Upravlinnâ, 2022 Object is a formal language for cellular automatons behavior description. The main tasks are 1) to describe variety of possible events that cell can experience in cellular automaton; 2) to define possible attributes that can cause these events (over ...
Н. Смолій +2 more
doaj +1 more source
Intrinsic Simulations between Stochastic Cellular Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 The paper proposes a simple formalism for dealing with deterministic, non-deterministic and stochastic cellular automata in a unifying and composable manner.
Pablo Arrighi +2 more
doaj +1 more source
Investigating CTL mediated killing with a 3D cellular automaton. [PDF]
PLoS Computational Biology, 2009 Cytotoxic T lymphocytes (CTLs) are important immune effectors against intra-cellular pathogens. These cells search for infected cells and kill them.
Frederik Graw, Roland R Regoes
doaj +1 more source
Вестник Дагестанского государственного технического университета: Технические науки, 2022 Objective. Development of a method for organizing the process of forming flows register structure, patented by the author at the Department of DSTU, which is a cellular automaton of binary sequences with a controlled structure of "cellular" automata in ...
P. A. Kadiev +2 more
doaj +1 more source