A christiansen grammar for universal splicing systems

Abstract

The main goal of this work is to formally describe splicing systems. This is a necessary step to subsequently apply Christiansen Grammar Evolution (an evolutionary tool developed by the authors) for automatic designing of splicing systems. Their large number of variants suggests us a decisions: to select a family as simple as possible of splicing systems equivalent to Turing machines. This property ensures that the kind of systems our grammar can generate is able to solve any arbitrary problem. Some components of these universal splicing systems depend on other components. So, a formal representation able to handle context dependent constructions is needed. Our work uses Christiansen grammars to describe splicing systems. © 2009 Springer Berlin Heidelberg.