摘要

In this work, the reversibility problem for the elementary cellular automaton with rule number 150 is tackled. Although this problem was solved before, we will introduce in this work an alternative construction of the inverse cellular automaton by means of the transition matrices instead of transition dipolynomials. This new approach allows one to obtain a more efficient and effective algorithm to compute the inverse cellular automaton.

  • 出版日期2013