Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Regulated Rewriting in Formal Language Theory
Regulated Rewriting in Formal Language Theory
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)
Computing by observing bio-systems: the case of sticker systems
DNA'04 Proceedings of the 10th international conference on DNA computing
Computing by Observing: A Brief Survey
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
DNA splicing: computing by observing
Natural Computing: an international journal
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
Computing by observing: Simple systems and simple observers
Theoretical Computer Science
DNA'05 Proceedings of the 11th international conference on DNA Computing
Evolution and observation: a non-standard way to accept formal languages
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
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 insertion
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Observer/Interpreter p systems
CMC'12 Proceedings of the 13th international conference on Membrane Computing
| Hi-index | 0.00 |
A very common approach in chemistry and biology is to observe the progress of an experiment, and take the result of this observation as the final output. Inspired by this, a new approach to computing, called system/observer, was introduced in [3]. In this paper we apply this strategy to sticker systems, [8,11]. In particular we use finite automata (playing the role of observer) watching the “evolution” of a sticker system and translating such “evolution” into a readable output. We show that this way of “computing by observing” brings us results quite different from the ones obtained when considering sticker systems in the standard manner. Even regular simple sticker systems (whose generative power is subregular) become universal when considered in this new framework. The significance of these results for DNA computing (by sticker systems) is briefly discussed.