Algebraic and Automata-Theoretic Properties of Formal Languages
Algebraic and Automata-Theoretic Properties of Formal Languages
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
Computation: finite and infinite machines
Computation: finite and infinite machines
Observation of String-Rewriting Systems
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
DNA'05 Proceedings of the 11th international conference on DNA Computing
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
Observer/Interpreter p systems
CMC'12 Proceedings of the 13th international conference on Membrane Computing
Hi-index | 0.00 |
The paradigm of evolution/observation is based on the idea that a computing device can be obtained by combining a basic system and an observer that transforms the evolution of the basic system into a readable output. In this framework we investigate what can be computed by changing the observer but not the basic observed system. We consider grammars as basic systems combined with finite state automata as observers, watching either the sequence of sentential forms or the productions used by the grammar. It is possible to obtain computational completeness only varying the observer, without modifying the basic system, which is a fixed context-free grammar.