Time-varying distributed H systems with parallel computations: The problem is solved

In this article we show that time-varying distributed H systems (TVDH systems) with one component are able to model any type-0 grammar. Thus we completely answered to the question of constructing TVDH systems of smallest degree which generate any RE language using the parallel nature of molecular computations based on splicing operations. Another interesting point is that the proof is based on a simulation of a TVDH system of degree two and not of type-0 grammars as it is usually done in similar proofs.