Formal languages
Splicing systems with targets are computationally universal
Information Processing Letters
Discrete Applied Mathematics
Where mathematics, computer science, linguistics and biology meet
Handbook of Formal Languages
Evolution and observation: a non-standard way to generate formal languages
Theoretical Computer Science
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
Observation of String-Rewriting Systems
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
Computing by observing bio-systems: the case of sticker systems
DNA'04 Proceedings of the 10th international conference on DNA computing
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Computing by Observing: A Brief Survey
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
How to make biological systems compute: simply observe them
Proceedings of the 3rd International Conference on Bio-Inspired Models of Network, Information and Computing Sytems
Theoretical Computer Science
Splicing systems: accepting versus generating
CiE'11 Proceedings of the 7th conference on Models of computation in context: computability in Europe
Computing by observing insertion
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Hi-index | 0.00 |
Motivated by several techniques for observing molecular processes in real-time we introduce a computing device that stresses the role of the observer in biological computations and that is based on the observed behavior of a splicing system. The basic idea is to introduce a marked DNA strand into a test tube with other DNA strands and restriction enzymes. Under the action of these enzymes the DNA starts to splice. An external observer monitors and registers the evolution of the marked DNA strand. The input marked DNA strand is then accepted if its observed evolution follows a certain expected pattern. We prove that using simple observers (finite automata), applied on finite splicing systems (finite set of rules and finite set of axioms), the class of recursively enumerable languages can be recognized.