Related papers: On discovering functions in actin filament automat…
We represent a filamentous actin molecule as a graph of finite-state machines (F-actin automaton). Each node in the graph takes three states --- resting, excited, refractory. All nodes update their states simultaneously and by the same…
Actin is a globular protein which forms long polar filaments in eukaryotic. The actin filaments play roles of cytoskeleton, motility units , information processing and learning. We model actin filament as a double chain of finite state…
Actin is a globular protein which forms long filaments in the eukaryotic cytoskeleton, whose roles in cell function include structural support, contractile activity to intracellular signalling. We model actin filaments as two chains of…
Actin is a globular protein which forms long polar filaments in the eukaryotic cytoskeleton. Actin networks play a key role in cell mechanics and cell motility. They have also been implicated in information transmission and processing,…
Actin filaments are conductive to ionic currents, mechanical and voltage solitons. These travelling localisations can be utilised in making the actin network executing specific computing circuits. The propagation of localisations on a…
We consider the problem of studying the simulation capabilities of the dynamics of arbitrary networks of finite states machines. In these models, each node of the network takes two states 0 (passive) and 1 (active). The states of the nodes…
The actin droplet machine is a computer model of a three-dimensional network of actin bundles developed in a droplet of a physiological solution, which implements mappings of sets of binary strings. The actin bundle network is conductive to…
We define a cellular automaton where a resting cell excites if number of its excited neighbours belong to some specified interval and boundaries of the interval change depending on ratio of excited and refractory neighbours in the cell's…
We study a Life-like cellular automaton rule $B2/S2345$ where a cell in state `0' takes state `1' if it has exactly two neighbors in state `1' and the cell remains in the state `1' if it has between two and five neighbors in state `1.' This…
We study ground states and excited states in semiconductor quantum dots containing 1 to 12 electrons. For the first time, it is possible to identify the quantum numbers of the states in the excitation spectra and make a direct comparison to…
Random boolean cellular automata are investigated, where each gate has two randomly chosen inputs and is randomly assigned a boolean function of its inputs. The effect of non-uniform distributions on the choice of the boolean functions is…
Motivated by questions in biology and distributed computing, we investigate the behaviour of particular cellular automata, modelled as one-dimensional arrays of identical finite automata. We investigate what sort of self-stabilising…
We study two-dimensional cellular automata, each cell takes three states: resting, excited and refractory. A resting cell excites if number of excited neighbours lies in a certain interval (excitation interval). An excited cell become…
Starting with an experimentally observed networks of actin bundles, we model their network structure in terms of edges and nodes. We then compute and discuss the main electrical parameters, considering the bundles as electrical wires. A set…
We consider random boolean cellular automata on the integer lattice, i.e., the cells are identified with the integers from 1 to $N$. The behaviour of the automaton is mainly determined by the support of the random variable that selects one…
Filamentous actin, a species of dynamic protein polymers, is one of the main components of the cytoskeleton of eukaryotic cells. We formulate a class of models that predict the possibility of bistable steady states in populations of dynamic…
The microscopic control available over cold atoms in optical lattices has opened new opportunities to study the properties of quantum spin models. While a lot of attention is focussed on experimentally realizing ground or thermal states via…
We study the phase diagram and the critical behavior of a one-dimensional radius-1 two-state totalistic probabilistic cellular automaton having two absorbing states. This system exhibits a first-order phase transition between the fully…
We study transformations of 2-, 4- and 6-bit numbers in interactions between traveling and stationary localizations in the Spiral Rule reaction-diffusion cellular automaton. The Spiral Rule automaton is a hexagonal ternary-state…
An automata network is a finite graph where each node holds a state from some finite alphabet and is equipped with an update function that changes its state according to the configuration of neighboring states. More concisely, it is given…