Handbook of Formal Languages
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
Toward a Formal Macroset Theory
WMP '00 Proceedings of the Workshop on Multiset Processing: Multiset Processing, Mathematical, Computer Science, and Molecular Computing Points of View
Observation of String-Rewriting Systems
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
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
Observation of String-Rewriting Systems
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
Observer/Interpreter p systems
CMC'12 Proceedings of the 13th international conference on Membrane Computing
| Hi-index | 5.23 |
In biology and chemistry a standard proceeding is to conduct an experiment, observe its progress, and then take the result of this observation as the final output. Inspired by this, we have introduced P/O systems (A. Alhazov, C. Martín-Vide, Gh. Paun, Pre-Proc. of the Workshop on Membrane Computing 2003, Tarrragona, Spain; http://pizarro.fll.urv.es/continguts/linguistica/ proyecto/reports/wmc03.html), where languages are generated by multiset automata that observe the evolution of membrane systems.Now we apply this approach also to more classical devices of formal language theory. Namely, we use finite automata observing the derivations of grammars or of Lindenmayer systems. We define several modes of operation for grammar/observer systems. In two of these modes a context-free grammar (or even a locally commutative context-free grammar) with a finite automaton as observer suffices to generate any recursively enumerable language. In a third case, we obtain a class of languages between the context-free and context-sensitive ones.