Simple splicing systems Original Research Article

We consider one of the most restrictive classes of splicing (H) systems, namely based on splicing rules of the form (a, λ; a, λ), where a is a symbol in a given set and λ is the empty string. They correspond to a special class of “null context splicing systems”, as introduced in Head (1987). A series of language-theoretic properties of languages generated by such systems with finite sets of axioms are investigated.