Bounded Languages Meet Cellular Automata with Sparse Communication

@inproceedings{Kutrib2009BoundedLM,
  title={Bounded Languages Meet Cellular Automata with Sparse Communication},
  author={Martin Kutrib and Andreas Malcher},
  booktitle={DCFS},
  year={2009}
}
Cellular automata are one-dimensional arrays of interconnected interacting finite automata. We investigate one of the weakest classes, the real-time one-way cellular automata, and impose an additional restriction on their inter-cell communication by bounding the number of allowed uses of the links between cells. Moreover, we consider the devices as acceptors for bounded languages in order to explore the borderline at which non-trivial decidability problems of cellular automata classes become… 

Figures from this paper

On One-way One-bit O (One)-message Cellular Automata

References

SHOWING 1-10 OF 23 REFERENCES

Cellular automata with sparse communication

Fast Cellular Automata with Restricted Inter-Cell Communication: Computational Capacity

This work investigates d-dimensional iterative arrays and one-dimensional cellular automata operating in real and linear time, whose inter-cell communication is restricted to some constant number of bits indepen­ dent of the number of states, and shows that there is an infinite strict double dimension-bit hierarchy.

Descriptional Complexity of Cellular Automata and Decidability Questions

It is proved that the language class accepted by realtime-OCA is incomparable to many known and well-investigated language classes and nonrecursive trade-offs are shown to exist between certain restricted classes of cellular automata.

Cellular Devices and Unary Languages

It is proved that there exists a unary complexity class in between the real-time and linear-time OCA languages, and that there is a gap between the unary real- time OCA Languages and that class.

Cellular Automata and Language Theory

  • Martin Kutrib
  • Computer Science
    Encyclopedia of Complexity and Systems Science
  • 2009
This chapter discusses iterative arrays, which are iterative automata whose leftmost cell is distinguished, and cellular automata, a linear array of cells which are connected to both of their nearest neighbors and whose input data is determined by the input data.

Deterministic One-Way Simulation of Two-Way Real-Time Cellular Automata and Its Related Problems

Optimal Simulations Between Unary Automata

This work considers the problem of computing the costs — in terms of states — of optimal simulations between different kinds of finite automata recognizing unary languages and shows that, given a unary n-state two-way nondeterministic automaton, one can construct an equivalent O(n 2)-state one-way deterministic automata.

Linear Time Language Recognition on Cellular Automata with Restricted Communication

It is shown that for communication restricted CA two-way flow of information can be much more powerful than an arbitrary number of additional communication bits.

On Cellular Automata with a Finite Number of State Changes

The relation of the simplest class — i.e. the one with a constant number of changes per single automaton — to the Chomsky hierarchy is investigated and a comparison with sequential tape complexity is made.

On real-time cellular automata and trellis automata

SummaryIt is shown that f(n)-time one-way cellular automata are equivalent to f(n)-time trellis automata, the real-time one-way cellular automata languages are closed under reversal, the 2n-time