Abstract
Watson-Crick finite automata are language recognizing devices similar to finite automata introduced in DNA computing area. Local languages are of great interest in the study of formal languages using factors of length two or more. We define Watson-Crick local languages using double stranded sequences where the two strands relate to each other through a complementary relation inspired by the DNA complementarity. We also define tiling recognizable Watson-Crick local languages and prove some closure properties. We also extend Watson-Crick local languages to finite arrays and prove some closure properties.
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 callMore From: International Journal of Mathematics and Soft Computing
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.
