Computing by observing insertion

Authors:
Alexander Krassovitskiy;Peter Leupold
Affiliations:
Research Group on Mathematical Linguistics --- GRLMC, Rovira i Virgili University, Tarragona, Spain;Research Group on Mathematical Linguistics --- GRLMC, Rovira i Virgili University, Tarragona, Spain
Venue:
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Year:
2012

Citing 7
Cited 0

Contextual insertions/deletions and computability

Information and Computation
Operations and language generating devices suggested by the genome evolution

Theoretical Computer Science
Evolution and observation: a non-standard way to generate formal languages

Theoretical Computer Science
Observation of String-Rewriting Systems

Fundamenta Informaticae - SPECIAL ISSUE MCU2004
Note: On the weight of universal insertion grammars

Theoretical Computer Science
DNA splicing: computing by observing

Natural Computing: an international journal
Computing by observing bio-systems: the case of sticker systems

DNA'04 Proceedings of the 10th international conference on DNA computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Computing by Observing is a theoretical model for computation that tries to formalize the standard setup of experiments in natural sciences. We establish that insertion systems with empty contexts and only one inserted letter suffice in this architecture to accept all recursively enumerable languages. While so far in most cases context-free power was needed, here a sub-regular system leads to computational completeness in this context. Further, we investigate more complicated insertion systems in a model with less powerful observer called Observing Change.