Pure reaction automata.
Saved in:
| Title: | Pure reaction automata. |
|---|---|
| Authors: | Ascone, Rocco1 (AUTHOR) rocco.ascone@phd.units.it, Bernardini, Giulia1 (AUTHOR), Formenti, Enrico2 (AUTHOR), Leiter, Francesco1 (AUTHOR) francesco.leiter@studenti.units.it, Manzoni, Luca1 (AUTHOR) |
| Source: | Natural Computing. Jun2024, Vol. 23 Issue 2, p189-204. 16p. |
| Subjects: | Computable functions, Formal languages, Standard language |
| Abstract: | This 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. [ABSTRACT FROM AUTHOR] |
| Copyright of Natural Computing is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
| Abstract: | This 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. [ABSTRACT FROM AUTHOR] |
|---|---|
| ISSN: | 15677818 |
| DOI: | 10.1007/s11047-024-09980-7 |
