Abstract
In this work, we construct splicing recognizers of radius 2 capable of accepting recursively enumerable languages. Cavaliere, Jonoska and Leupold introduced the concept of splicing recognizers in 2006 and constructed splicing recognizers of radius 4 which can accept recursively enumerable languages. It was conjectured that the radius of splicing recognizers, accepting recursively enumerable languages can be decreased. We prove in this paper that the conjecture is true and in fact, radius 2 is sufficient. We also introduce the concept of time varying splicing recognizers and show that these recognizers of radius 1 are capable of accepting recursively enumerable languages.
Sign-in/Register to access full text options 
Free) 
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
