%0 Conference Proceedings
%T Computational Completeness of Networks of Evolutionary Processors with Elementary Polarizations and a Small Number of Processors
%+ Vienna University of Technology = Technische Universität Wien (TU Wien)
%+ Åbo Akademi University [Turku]
%+ Laboratoire d'Algorithmique Complexité et Logique (LACL)
%A Freund, Rudolf
%A Rogojin, Vladimir
%A Verlan, Sergey
%Z Part 2: Contributed Papers
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 19th International Conference on Descriptional Complexity of Formal Systems (DCFS)
%C Milano, Italy
%Y Giovanni Pighizzini
%Y Cezar Câmpeanu
%I Springer International Publishing
%3 Descriptional Complexity of Formal Systems
%V LNCS-10316
%P 140-151
%8 2017-07-03
%D 2017
%R 10.1007/978-3-319-60252-3_11
%Z Computer Science [cs]Conference papers
%X We improve previous results obtained for networks of evolutionary processors with elementary polarizations $-1,0,1$ by showing that only the very small number of seven processors is needed to obtain computational completeness. In the case of not requiring a special output node even only five processors are shown to be sufficient.
%G English
%Z TC 1
%Z WG 1.2
%2 https://inria.hal.science/hal-01657015/document
%2 https://inria.hal.science/hal-01657015/file/440206_1_En_11_Chapter.pdf
%L hal-01657015
%U https://inria.hal.science/hal-01657015
%~ LACL
%~ UPEC
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC1
%~ IFIP-WG
%~ IFIP-DCFS
%~ IFIP-WG1-2
%~ IFIP-LNCS-10316