Computational Completeness of Networks of Evolutionary Processors with Elementary Polarizations and a Small Number of Processors

Rudolf Freund, Vladimir Rogojin, Sergey Verlan. Computational Completeness of Networks of Evolutionary Processors with Elementary Polarizations and a Small Number of Processors. In Giovanni Pighizzini, Cezar Câmpeanu, editors, Descriptional Complexity of Formal Systems - 19th IFIP WG 1.02 International Conference, DCFS 2017, Milano, Italy, July 3-5, 2017, Proceedings. Volume 10316 of Lecture Notes in Computer Science, pages 140-151, Springer, 2017. [doi]

Abstract

Abstract is missing.