AbstractThe effect of adding two-way communication to k cells one-way cellular automata (kC-OCAs) on their size of description is studied. kC-OCAs are a parallel model for the regular languages that consists of an array of k identical deterministic finite automata (DFAs), called cells, operating in parallel. Each cell gets information from its right neighbor only. In this paper, two models with different amounts of two-way communication are investigated. Both models always achieve quadratic savings when compared to DFAs. When compared to a one-way cellular model, the result is that minimum two-way communication can achieve at most quadratic savings whereas maximum two-way communication may provide savings bounded by a polynomial of degree k
This paper introduces a special class of cellular automata, called triangle cellular automata, which...
AbstractThe notions of universality and completeness are central in the theories of computation and ...
We study cellular automata with respect to a new communication complexity problem: each of two playe...
The effect of adding two-way communication to k cells one-way cellular automata (kC-OCAs) on their s...
AbstractThe effect of adding two-way communication to k cells one-way cellular automata (kC-OCAs) on...
We investigate a restricted one-way cellular automaton (OCA) model where the number of cells is boun...
AbstractCellular automata are one-dimensional arrays of interconnected interacting finite automata, ...
International audienceWe investigate the descriptional complexity of basic operations on real-time o...
We study the descriptional complexity of cellular automata (CA), a parallel model of computation. We...
This paper studies a restriction of one-dimensional bounded cellular automata in which information i...
AbstractWe investigate cellular automata whose internal inter-cell communication is bounded. The com...
AbstractA d-dimensional cellular automaton is a d-dimensional grid of interconnected interacting fin...
A d-dimensional cellular automaton with sequential input mode is a d-dimensional grid of interconnec...
We investigate cellular automata whose internal inter-cell communication is bounded. The communicati...
AbstractWe study cellular automata with respect to a new communication complexity problem: each of t...
This paper introduces a special class of cellular automata, called triangle cellular automata, which...
AbstractThe notions of universality and completeness are central in the theories of computation and ...
We study cellular automata with respect to a new communication complexity problem: each of two playe...
The effect of adding two-way communication to k cells one-way cellular automata (kC-OCAs) on their s...
AbstractThe effect of adding two-way communication to k cells one-way cellular automata (kC-OCAs) on...
We investigate a restricted one-way cellular automaton (OCA) model where the number of cells is boun...
AbstractCellular automata are one-dimensional arrays of interconnected interacting finite automata, ...
International audienceWe investigate the descriptional complexity of basic operations on real-time o...
We study the descriptional complexity of cellular automata (CA), a parallel model of computation. We...
This paper studies a restriction of one-dimensional bounded cellular automata in which information i...
AbstractWe investigate cellular automata whose internal inter-cell communication is bounded. The com...
AbstractA d-dimensional cellular automaton is a d-dimensional grid of interconnected interacting fin...
A d-dimensional cellular automaton with sequential input mode is a d-dimensional grid of interconnec...
We investigate cellular automata whose internal inter-cell communication is bounded. The communicati...
AbstractWe study cellular automata with respect to a new communication complexity problem: each of t...
This paper introduces a special class of cellular automata, called triangle cellular automata, which...
AbstractThe notions of universality and completeness are central in the theories of computation and ...
We study cellular automata with respect to a new communication complexity problem: each of two playe...