We show that a slightly extended version of asynchronous cellular automata, relative to any class of pomsets and dags without autoconcurrency, has the same expressive power as the ...
This paper discusses a class of 2-dimensional asynchronous cellular automata with conservation of mass, for the formation of patterns in groups. The previous study reported a metho...
Background: The behaviors of cells in metazoans are context dependent, thus large-scale multicellular modeling is often necessary, for which cellular automata are natural candidat...
For simulating physical and chemical processes on molecular level asynchronous cellular automata with probabilistic transition rules are widely used being sometimes referred to as ...
In this work, we give an algorithm that infers Regular Trace Languages. Trace languages can be seen as regular languages that are closed under a partial commutation relation called...