SIMPLE SPLICING SYSTEMS

We consider one of the most restrictive classes of splicing (H) system s, namely based on splicing rules of the form (a,lambda; a,lambda), wh ere a is a symbol in a given set and lambda 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. (C) 1998 Elsevier Science B.V. All rights reserved.