Abstract
Several models of finite state automata in biomolecular computing are already in literature and some of these models have been also implemented in vitro showing their possible feasibility. On the other side, DNA self assembly of two-dimensional arrays have been achieved by variety of DNA-like tiles, moreover, algorithmic self assembly simulations of the Sierpinski triangle and binary counters have also been recorded. With this talk we describe an implementation of couple of models by DNA and we concentrate on the recent implementation of a finite state transducer (finite state automaton with output) by Wang like DNA tiles simulated with triple cross-over DNA molecules.
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.
