This chapter deals with the reversibility of non-uniform cellular automata (CAs). It starts with the basics of reversibility and then discusses on the decidability issues of reversible CAs, defined over infinite lattice (Sect. 4.1). The finite non-uniform ECAs—that is, the finite CAs with only ECA rules are the major consideration of this chapter.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Reversibility

  • Sukanta Das,
  • Biplab K. Sikdar

摘要

This chapter deals with the reversibility of non-uniform cellular automata (CAs). It starts with the basics of reversibility and then discusses on the decidability issues of reversible CAs, defined over infinite lattice (Sect. 4.1). The finite non-uniform ECAs—that is, the finite CAs with only ECA rules are the major consideration of this chapter.