{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T08:20:02Z","timestamp":1777105202864,"version":"3.51.4"},"reference-count":4,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2011,1]]},"abstract":"<jats:p> Reaction systems are a formal model of interactions between biochemical reactions. They consist of sets of reactions, where each reaction is classified by its set of reactants (needed for the reaction to take place), its set of inhibitors (each of which prevents the reaction from taking place), and its set of products (produced when the reaction takes place) \u2013 the set of reactants and inhibitors form the resources of the reaction. Each reaction system defines a (transition) function on its set of states. (States here are subsets of an a priori given set of biochemical entities.) In this paper we investigate properties of functions defined by reaction systems. In particular, we investigate how the power of defining functions depends on available resources, and we demonstrate that with small resources one can define functions exhibiting complex behavior. <\/jats:p>","DOI":"10.1142\/s0129054111007927","type":"journal-article","created":{"date-parts":[[2011,1,21]],"date-time":"2011-01-21T10:43:19Z","timestamp":1295606599000},"page":"167-178","source":"Crossref","is-referenced-by-count":64,"title":["FUNCTIONS DEFINED BY REACTION SYSTEMS"],"prefix":"10.1142","volume":"22","author":[{"given":"ANDRZEJ","family":"EHRENFEUCHT","sequence":"first","affiliation":[{"name":"Department of Computer Science, University of Colorado at Boulder, 430 UCB, Boulder, CO 80309, USA"}]},{"given":"MICHAEL","family":"MAIN","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Colorado at Boulder, 430 UCB, Boulder, CO 80309, USA"}]},{"given":"GRZEGORZ","family":"ROZENBERG","sequence":"additional","affiliation":[{"name":"Leiden Institute of Advanced Computer Science, Leiden University, Niels Bohrweg 1, 2333 CA Leiden, The Netherlands"},{"name":"Department of Computer Science, University of Colorado at Boulder, 430 UCB, Boulder, CO 80309, USA"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf1","first-page":"1","volume":"76","author":"Ehrenfeucht A.","journal-title":"Fundamenta Informaticae"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.01.008"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.09.043"},{"key":"rf4","volume":"21","author":"Ehrenfeucht A.","journal-title":"International Journal of Foundations of Computer Science"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054111007927","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T00:54:13Z","timestamp":1565139253000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054111007927"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,1]]},"references-count":4,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2011,1]]}},"alternative-id":["10.1142\/S0129054111007927"],"URL":"https:\/\/doi.org\/10.1142\/s0129054111007927","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,1]]}}}