Abstract

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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.