Abstract:
In this thesis we consider the problem of discovering the topology of various popular P Systems from a single starting source. We first formalise the notion of discovery algorithms for this field ensuring that the model we create is Turing complete and second show how our discovery system can be run within predefined P Systems. After defining our computational model we show how it can be used to both discover and distribute information. This distribution is first performed upon systems with an acyclic underlying structure and then extended to cyclic systems. We also show that it is possible to determine the full underlying structure of an acyclic system starting from a single source but impossible to determine the full structure of a cyclic system due to the lack of cell identifications.