Decidable properties for regular cellular automata
P Di Lena - Fourth IFIP International Conference on Theoretical …, 2006 - Springer
Fourth IFIP International Conference on Theoretical Computer Science-TCS 2006 …, 2006•Springer
… We investigate decidable properties for regular cellular automata. In particular, we show
that regularity itself is an undecidable property and that nilpotency, equicontinuity and
positively expansiveness became decidable if we restrict to regular cellular automata. … In
contrast, we show that some topological properties which are in general undecidable
become decidable if we restrict to the class of regular CA. For instance, we show that for …
that regularity itself is an undecidable property and that nilpotency, equicontinuity and
positively expansiveness became decidable if we restrict to regular cellular automata. … In
contrast, we show that some topological properties which are in general undecidable
become decidable if we restrict to the class of regular CA. For instance, we show that for …
Abstract
We investigate decidable properties for regular cellular automata. In particular, we show that regularity itself is an undecidable property and that nilpotency, equicontinuity and positively expansiveness became decidable if we restrict to regular cellular automata.
Springer
以上显示的是最相近的搜索结果。 查看全部搜索结果