In the literature of algorithms, the specific computation model is often not explicit as it is
assumed that the model of computation is the RAM (Random Access Machine) model …

Some Computational Limits of Trellis Automata | SpringerLink Skip to main content
Advertisement SpringerLink Account Menu Find a journal Publish with us Track your research …

We provide an overview of three different operating modes of cellular automata. A classical
point of view is to consider cellular automata as acceptors for formal languages. As usual …

The parallel models of cellular automata and iterative arrays are investigated towards their
ability to compute transductions, that is, to transform inputs into outputs. The families of …

In contrast to many investigations of cellular automata with regard to their ability to accept
inputs under certain time constraints, in this paper we are studying cellular automata with …

To determine the computational capacity of cellular automata they are often investigated
towards their ability to accept formal languages within certain time constraints. In this paper …

To determine the computational capacity of cellular automata they are often investigated
towards their ability to accept formal languages within certain time constraints. In this paper …

In contrast to many investigations of cellular automata with regard to their ability to accept
inputs under certain time constraints, we are studying here cellular automata towards their …

Nous étudions dans ce mémoire les propriétés des ensembles de pavages engendrés par
des jeux de tuiles de Wang exhibant une ou plusieurs directions de déterminisme local, en …