Abstract
Splicing systems are a generative device inspired by a cut and paste phenomenon on DNA molecules, introduced by Head in 1987 and subsequently defined with slight variations also by Paun and Pixton respectively [8, 13, 17]. We will face the problem of characterizing the class of regular languages generated by finite splicing systems. We will solve this problem for the special class of the reflexive finite splicing systems introduced in [9, 10]. As a byproduct, we give a characterization of the regular languages generated by finite Head splicing systems. As in already known results, the notion of constant, given by Schützenberger in [19], intervenes.KeywordsCanonical TransformationRegular LanguageState AutomatonDiscrete Apply MathematicFormal Language TheoryThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
