Reachability in Resource-Bounded Reaction Systems
From MaRDI portal
Publication:2798751
DOI10.1007/978-3-319-30000-9_45zbMath1443.68065OpenAlexW2294464936MaRDI QIDQ2798751
Antonio E. Porreca, Alberto Dennunzio, Luca Manzoni, Enrico Formenti
Publication date: 13 April 2016
Published in: Language and Automata Theory and Applications (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10281/107073
reachabilitydiscrete dynamical systemsnatural computingreaction systemsunconventional models of computation
Analysis of algorithms and problem complexity (68Q25) Biochemistry, molecular biology (92C40) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)
Related Items
Evolvability of reaction systems and the invisibility theorem, A graph isomorphism condition and equivalence of reaction systems, Complexity of the dynamics of reaction systems, Fixed points and attractors of reactantless and inhibitorless reaction systems, Unnamed Item, Facilitation in reaction systems, Controllability of reaction systems, Transition graphs of reversible reaction systems, Companions and an Essential Motion of a Reaction System