Categories of (ℓ, ℛ)-systems

摘要: We show that when we represent (l, ℛ)-systems with fixed genome as automata (sequential machines), get output-dependent states. This yields a short proof ((l, from subcategory of automata—and more homomorphisms than previously exhibited. how variable genetic structure may be represented and use this embedding to set up larger the category automata. An analogy dynamical systems is briefly discussed. paper presents formal exploration extension some ideas presented by Rosen (Bull. Math. Biophyss,26, 103–111, 1964;28, 141–148;28 149–151). refer reader these papers, references cited therein, for discussion relevance material relational biology.