Abstract
In reaction systems introduced by Ehrenfeucht and Rozenberg the number of resources is essential when various questions concerning generative capacity are investigated. While almost all functions from the set of subsets of a finite set \(S\) into itself can be defined by unrestricted reaction systems, only a specific subclass of such functions is defined by minimal reaction systems. In this paper we show that also minimal reaction systems suffice for defining all such functions, provided repetitive use is allowed. Specifically, everything generated by an arbitrary reaction system is generated by a minimal one in three steps. In this way also some functions not at all definable by reaction systems can be generated by minimal reaction systems. All subsets of \(S\), in any prechosen order, appear in the sequence of a minimal reaction system.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Brijder, R., Ehrenfeucht, A., Main, M., Rozenberg, G.: A tour of reaction systems. International Journal of Foundations of Computer Science 22, 1499–1517 (2011)
Ehrenfeucht, A., Kleijn, J., Koutny, M., Rozenberg, G.: Minimal reaction systems. In: Priami, C., Petre, I., de Vink, E. (eds.) Transactions on Computational Systems Biology XIV. LNCS, vol. 7625, pp. 102–122. Springer, Heidelberg (2012)
Ehrenfeucht, A., Main, M., Rozenberg, G.: Functions defined by reaction systems. International Journal of Foundations of Computer Science 22, 167–178 (2011)
Ehrenfeucht, A., Rozenberg, G.: Reaction systems. Fundamenta Informaticae 7, 263–280 (2007)
Ehrenfeucht, A., Rozenberg, G.: Zoom structures and reaction systems yield exploration systems. International Journal of Foundations of Computer Science (to appear, 2014)
Formenti, E., Manzoni, L., Porreca, A.E.: On the complexity of occurrence and convergence problems for reaction systems. Natural Computing (to appear, 2014)
Montagna, F., Rozenberg, G.: On minimal reaction systems, forthcoming. (G. Rozenberg, personal communication.)
Piccard, S.: Sur les bases du groupe symétrique et les couples de substitutions qui engendrent un goupe régulier. Librairie Vuibert, Paris (1946)
Salomaa, A.: Composition sequences for functions over a finite domain. Theoretical Computer Science 292, 263–281 (2003)
Salomaa, A.: On state sequences defined by reaction systems. In: Constable, R.L., Silva, A. (eds.) Logic and Program Semantics, Kozen Festschrift. LNCS, vol. 7230, pp. 271–282. Springer, Heidelberg (2012)
Salomaa, A.: Functions and sequences generated by reaction systems. Theoretical Computer Science 466, 87–96 (2012)
Salomaa, A.: Functional constructions between reaction systems and propositional logic. International Journal of Foundations of Computer Science 24, 147–159 (2013)
Salomaa, A.: Minimal and almost minimal reaction systems. Natural Computing 12, 369–376 (2013)
Salomaa, A.: Compositions of reaction systems. Submitted for publication (2013)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Salomaa, A. (2014). Minimal Reaction Systems Defining Subset Functions. In: Calude, C., Freivalds, R., Kazuo, I. (eds) Computing with New Resources. Lecture Notes in Computer Science(), vol 8808. Springer, Cham. https://doi.org/10.1007/978-3-319-13350-8_32
Download citation
DOI: https://doi.org/10.1007/978-3-319-13350-8_32
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-13349-2
Online ISBN: 978-3-319-13350-8
eBook Packages: Computer ScienceComputer Science (R0)