INJECTIVITY OF CELLULAR AUTOMATA
Our purpose is to analyze and prove as strictly and clearly as possible that cellular automata ’s of finite type with a quiescent state qare injective if and only if either contains two mutually erasable configurations in Moore [2] or two not distinguished configurations in Myhill [4].
cellular automaton, tessellation space, global map of configurations, mutually erasable, Garden of Eden.