Deciding if a Regular Language is Generated by a Splicing System

Details Deciding if a Regular Language is Generated by a Splicing System Deciding if a Regular Language is Generated by a Splicing System

2011-12-21

arxiv.org/abs/1112.4897v2

Computer Science

Formal Languages and Automata Theory

Scientific paper

Splicing as a binary word/language operation is inspired by the DNA recombination under the action of restriction enzymes and ligases, and was first introduced by Tom Head in 1987. Shortly after, it was proven that the languages generated by (finite) splicing systems form a proper subclass of the class of regular languages. However, the question of whether or not one can decide if a given regular language is generated by a splicing system remained open. In this paper we give a positive answer to this question. We namely prove that, if a language is generated by a splicing system, then it is also generated by a splicing system whose size is a function of the size of the syntactic monoid of the input language, and which can be effectively constructed.

Affiliated with

Also associated with

No associations

Rating

Deciding if a Regular Language is Generated by a Splicing System does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Deciding if a Regular Language is Generated by a Splicing System, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Deciding if a Regular Language is Generated by a Splicing System will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-190780