Author:
Ascone Rocco,Bernardini Giulia,Formenti Enrico,Leiter Francesco,Manzoni Luca
Abstract
AbstractThis work introduces the new class of pure reaction automata, as well as a new update manner, called maximal reactive manner, that can also be applied to standard reaction automata. Pure reaction automata differ from the standard model in that they don’t have permanence: the entities that are not consumed by the reactions happening at a certain state are not conserved in the result states. We prove that the set of languages accepted by the new class under the maximal reactive manner contains the set of languages accepted by standard reaction automata under the same manner or under the maximal parallel manner. We also prove that a strict subclass of pure reaction automata can compute any partial recursive function.
Funder
Università degli Studi di Trieste
Publisher
Springer Science and Business Media LLC