Potential automata. Application to the genetic code III

In previous notes, we have described both mathematical properties of potential (n-switches) and potential-Hamiltonian (Liénard systems) continuous differential systems, and also biological applications, especially those concerning primitive cyclic RNAs related to the genetic code. In the present note, we give a general definition of a potential automaton, and we show that a discrete Hopfield-like system already introduced by Goles et al. is a good candidate for such a potential automaton: it has a Lyapunov functional that decreases on its trajectories and whose time derivative is just its discrete velocity. Then we apply this new notion of potential automaton to the genetic code. We show in particular that the consideration of only physicochemical properties of amino-acids, like their molecular weight, hydrophobicity and ability to create hydrogen bonds suffices to build a potential decreasing on trajectories corresponding to the synonymy classes of the genetic code. Such an 'a minima' construction reinforces the classical stereochemical hypothesis about the origin of the genetic code and authorizes new views about the optimality of its synonymy classes.