| Literature DB >> 23336016 |
Tomonori Kawano1, François Bouteau, Stefano Mancuso.
Abstract
The automata theory is the mathematical study of abstract machines commonly studied in the theoretical computer science and highly interdisciplinary fields that combine the natural sciences and the theoretical computer science. In the present review article, as the chemical and biological basis for natural computing or informatics, some plants, plant cells or plant-derived molecules involved in signaling are listed and classified as natural sequential machines (namely, the Mealy machines or Moore machines) or finite state automata. By defining the actions (states and transition functions) of these natural automata, the similarity between the computational data processing and plant decision-making processes became obvious. Finally, their putative roles as the parts for plant-based computing or robotic systems are discussed.Entities:
Keywords: aqueous computing; automaton; plant enzyme; plant signaling
Year: 2012 PMID: 23336016 PMCID: PMC3541313 DOI: 10.4161/cib.21805
Source DB: PubMed Journal: Commun Integr Biol ISSN: 1942-0889

Figure 1. State transitions in Mealy machine and Moore machine. These sequential machines (A) and (B) consist of states (represented by circles), and transitions (represented by arrows). The initial states are shown by the double arrows. As the machine meets an input, it makes a jump to another state, according to the transition function defined (based on the current state and the recent symbol of inputs). Above illustrations were adopted from ref.1 Temporal difference in the behaviors of two simple sequential machines are compared in (C) and (D). As shown in (C), Mealy machine's action is just to exchange an input event with an output event. In contrast, many signaling molecules may behave similarly to a Moore machine during signal transduction in aqueous computing or biological systems (D). Thus, any given single (chemical) event can be considered as an input for a receptor or protein involved in signaling. Once the molecule of interest is activated by single (chemical) event such as phosphorylation, binding to calcium, binding to the ligands, etc., the molecule becomes activated for certain length of time. During the activated state, the molecule (Moore machine) might keep acting by emitting multiple signals.

Figure 2. Volatile memory processing determining the closure of the trap in Venus flytrap can be attributed to “automata.” (A) The simplified signaling mechanism of trap closure induced after processing the mechanical input in Venus flytrap, supported by experimental and theoretical analyses (Modified from Volkov et al.13). (B) Transition state of FSA M1 counting the number of stimuli. The states allowed in M1 are represented by circles, and the transitions are represented by the arrows. The initial state is shown by the double arrow and the final state is shown with the double circle. Input can be accepted (thus, closure induced) only after repeated stimuli. FSA M1 = (Q1, Σ1, δ1, q01, F1), where Q1 = {p, q, r}, Σ1 = {0, 1}, δ1(p, 0) = p, δ1(p, 1), = q, δ1(q, 0) = q, δ1(q, 1), = r, δ1(r, 0) = p, δ1(r, 1), = r, q01 = r, F1 = r. (C) The behavior of FSA M1 can be attributed to two types of metaphorical FSA Mp1 and Mc1 functioning as a whole plant and the cells composing the plant, respectively. At the level of molecular interactions, the function for Mc1 can be considered as synthesis of functions for various molecular FSA (Mm1, Mm1’, Mm1”…).

Figure 3. Behavior of plant peroxidase as a redox-active mealy machine (M2). Based on the language (input signals) used, M2 can be separately described as two different automata (M2’ and M2”). (A) The hourglass model summarizing the superoxide generating reactions catalyzed by plant peroxidases responsive to both salicylic acid (SA, a model substrate for peroxidase cycle), aromatic monoamines (AMA) and indole-3-acetic acid (IAA, a model substrate for oxygenation cycle).20 (B) Redox-active Mealy machine M2’. M2’ = (Q2’, Σ2’, Δ2’, δ2’, λ2’, q02’), where Q2’ = {q0, q3, q4, q5,}, Σ2’ = {0, IAA, O2}, Δ2’ = {0, 1}, δ2’(q0, 0) = q0, δ2’(q0, IAA) = q4, δ2’(q0, O2) = q0, δ2’(q4, 0) = q4, δ2’(q4, IAA) = q4, δ2’(q4, O2) = q3, δ2’(q3, 0) = q0, δ2’(q3, IAA) = q5, δ2’(q3, O2) = q0, δ2’(q5, 0) = q5, δ2’(q5, IAA) = q5, δ2’(q5, O2) = q5, λ2’(q0, 0) = 0, λ2’(q0, IAA) = 0, λ2’(q0, O2) = 0, λ2’(q4, 0) = 0, λ2’(q4, IAA) = 0, λ2’(q4, O2), = 0, λ2’(q3, 0) = 1, λ2’(q3, IAA) = 0, λ2’(q3, O2) = 0, λ2’(q5, 0) = 0, λ2’(q5, IAA) = 0, λ2’(q5, O2) = 0, q02’ = q0. (c) Redox-active Mealy machine M2.” M2” = (Q2”’, Σ2,” Δ2”’, δ2,” λ2”’, q02”), where Q2” = {q0, q1, q2}, Σ2” = {0, H2O2, SA}, Δ2” = {0, 1}, δ2” (q0, 0) = q0, δ2”(q0, H2O2) = q1, δ2”(q0, SA) = q0, δ2”(q1, 0) = q1, δ2”(q1, H2O2) = q1, δ2”(q1, SA) = q2, δ2”(q2, 0) = q2, δ2”(q2, H2O2) = q2, δ2”(q2, SA) = q0, λ2”(q0, 0) = 0, λ2”(q0, H2O2) = 0, λ2”(q0, SA) = 0, λ2”(q1, 0) = 0, λ2”(q1, H2O2) = 0, λ2”(q1, SA), = 1, λ2”(q2, 0) = 0, λ2”(q2, H2O2) = 0, λ2”(q2, SA) = 1, q02” = q0. Note, Δ2’ = Δ2” = {0, 1} = {φ, O2·-}.

Figure 4. Proposed models for plantoids, cells, and molecules functioning as automata. (A) A model of plantoid produced by Prof. S. Mancuso (Univ. Florence). (B) Image of an electro-physiologically monitored cell (Prof. F. Bouteau, Univ. Paris-Diderot). (C) An artificial enzyme behaving as a plant peroxidase mimic.038 (D) State transitions in deterministic finite automata (DFA) M3. M3 = (Q3, Σ3, δ3, q03, F3), where Q3 = {q0, q1, q2, q3}, Σ3 = {0, 1}, δ3(q0, 0) = q0, δ3(q0, 1) = q1, δ3(q1, 0) = q0, δ3(q1, 1) = q2, δ3(q2, 0) = q3, δ3(q2, 1) = q2, δ3(q3, 0) = q3, δ3(q3, 1) = q1, q03 = q0, F3 = {q2, q3}. (E) State transitions in nondeterministic finite automata (NFA) M3’. M3’ = (Q3’, Σ3’, δ3’, q03’, F3’), where Q3’ = {r0, r1, r2}, Σ3’ = {0, 1}, δ3’(r0, 0) = {r0}, δ3’(r0, 1) = {r0, r1}, δ3’(r1, 0) = φ, δ3’(r1, 1) = r2, δ3’(r2, 0) = r2, δ3’(q2, 1) = φ, q03’ = r0, F3’ = r2.