Complexity-preserving simulations among three variants of accepting networks of evolutionary processors Paolo Bottoni • Anna Labella • Florin Manea • Victor Mitrana • Ion Petre • Jose M. Sempere Published online: 21 January 2011 Ó Springer Science+Business Media B.V. 2011 Abstract In this paper we consider three variants of accepting networks of evolutionary processors. It is known that two of them are equivalent to Turing machines. We propose here a direct simulation of one device by the other. Each computational step in one model is simulated in a constant number of computational steps in the other one while a Florin Manea is on leave of absence from the University of Bucharest. P. Bottoni  A. Labella Department of Computer Science, ‘‘Sapienza’’ University of Rome, Via Salaria 113, 00198 Rome, Italy e-mail: bottoni@di.uniroma1.it A. Labella e-mail: labella@di.uniroma1.it F. Manea Faculty of Computer Science, Otto-von-Guericke University, P.O. Box 41 20, 39016 Magdeburg, Germany e-mail: flmanea@gmail.com V. Mitrana (&) Faculty of Mathematics, University of Bucharest, Str. Academiei 14, 010014 Bucharest, Romania e-mail: mitrana@fmi.unibuc.ro V. Mitrana Depto. Organizacio ´n y Estructura de la Informacio ´n, Universidad Polite ´cnica de Madrid, Crta. de Valencia km. 7, 28031 Madrid, Spain I. Petre Department of Information Technologies, A ˚ bo Akademi University, ICT-building, Joukahaisenkatu 3-5 A, 20520 Turku, Finland e-mail: ipetre@abo.fi J. M. Sempere Department of Information Systems and Computation, Technical University of Valencia, Camino de Vera s/n., 46022 Valencia, Spain e-mail: jsempere@dsic.upv.es 123 Nat Comput (2011) 10:429–445 DOI 10.1007/s11047-010-9238-5