Surjectivity of nondeterministic parallel maps induced bynondeterministic cellular automata

  • Authors:

  • Takeo Yaku

  • Affiliations:

  • -

  • Venue:
  • Journal of Computer and System Sciences
  • Year:
  • 1976

Quantified Score

Hi-index 0.00

Visualization

Abstract

For and d=2, it is recursively unsolvable if the global mapping for a d-dimensionalnondeterministic cellular automaton is surjective. It is also unsolvable when the global mapping is restricted to the set of configurations with finite support.