Abstract

The relationship between the family SH of simple splicing languages, which was recently introduced by Mateescu et al. and the family SLT of strictly locally testable languages is clarified by establishing an ascending hierarchy of families { S i H: i⩾ − 1} of splicing languages for which SH = S 1 H and the union of the families is the family SLT. A procedure is given which, for an arbitrary regular language L, determines whether L is in SLT and, when L is in SLT, specifies constructively the smallest family in the hierarchy to which L belongs. Examples are given of sets of restriction enzymes for which the action on DNA molecules is naturally represented by splicing systems of the types discussed.

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.