Titlebook: Cellular Automata and Discrete Complex Systems; 20th International W Teijiro Isokawa,Katsunobu Imai,Hiroshi Umeo Conference proceedings 201

影响

Real-Time Reversible One-Way Cellular Automatamata. Additionally, we obtain that the corresponding language class is closed under Boolean operations, and we prove the undecidability of several decidability questions. Finally, it is shown that the reversibility of an arbitrary real-time circular one-way cellular automaton is undecidable as well.

Comprise

aquatic

https://doi.org/10.1007/978-3-319-18812-6Automata networks; Complexity class; Computational complexity; Cycle equivalence; Decidability; Discrete

愉快吗

Mortar

CRACK

https://doi.org/10.1007/978-3-322-84184-1In this article, we study countable sofic shifts of Cantor-Bendixson rank at most 2. We prove that their conjugacy problem is complete for ., the complexity class of graph isomorphism, and that the existence problems of block maps, factor maps and embeddings are .-complete.

灰姑娘

Computational Complexity of the Avalanche Problem on One Dimensional Kadanoff SandpilesIn this paper we prove that the general . . is in .  for the Kadanoff sandpile model in one dimension, answering an open problem of [.]. Thus adding one more item to the (slowly) growing list of dimension sensitive problems since in higher dimensions the problem is .-complete (for monotone sandpiles).

Myofibrils

Complexity of Conjugacy, Factoring and Embedding for Countable Sofic Shifts of Rank 2In this article, we study countable sofic shifts of Cantor-Bendixson rank at most 2. We prove that their conjugacy problem is complete for ., the complexity class of graph isomorphism, and that the existence problems of block maps, factor maps and embeddings are .-complete.

高脚酒杯

窃喜