Formal languages
Church-Rosser Thue systems and formal languages
Journal of the ACM (JACM)
String-rewriting systems
2-testability and relabelings produce everything
Journal of Computer and System Sciences
Introduction to Formal Language Theory
Introduction to Formal Language Theory
McNaughton families of languages
Theoretical Computer Science
The context-splittable normal form for Church--Rosser language systems
Information and Computation - RTA 2001
Evolution and observation: a non-standard way to generate formal languages
Theoretical Computer Science
Deleting string rewriting systems preserve regularity
Theoretical Computer Science - Developments in language theory
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)
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: 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
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
Membrane system models for super-Turing paradigms
Natural Computing: an international journal
Fundamenta Informaticae - Non-Classical Models of Automata and Applications II
Hi-index | 0.00 |
Models of computation in theoretical computer science very frequently consist of a device performing some type of process, like a Turing machine and its computation or a grammar and its derivation. After the process halts, only some final output is regarded as the result. In adding an observer to such a device, one can obtain a protocol of the entire process and then use this as the result of the computation. In several recent articles this approach has proved to often exceed greatly the power of the observed system. Here we apply this architecture to string-rewriting systems. They receive a string as input, and a combination of observer and decider then determines whether this string is accepted. This decision is based only on the rewriting process performed. First we determine the power of painter, context-free, and inverse context-free rewriting systems in terms of McNaughton languages. Then these are investigated as components of rewriting/observer systems, and we obtain characterizations of the classes of context-sensitive and recursively enumerable languages. Finally we investigate some limitations, i.e. characterize some systems, where observation does not increase power.