Computing by Only Observing
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.
KeywordsRegular Language State Automaton Sentential Form Formal Language Theory Output Alphabet
Unable to display preview. Download preview PDF.
- 3.Cavaliere, M., Leupold, P.: Observation of string-rewriting systems. Fundamenta Informaticae (to appear)Google Scholar
- 7.Dassow, J., Păun, G.: Regulated rewriting in formal language theory. EATCS monographs in Theoretical computer science, vol. 18. Springer, Heidelberg (1989)Google Scholar
- 9.Ginsburg, S.: Algebraic and automata-theoretic properties of formal languages, Foundamental studies in computer science, vol. 2. North-Holland, Amsterdam (1975)Google Scholar
- 12.Leupold, P.: Non-universal G/O systems (submitted)Google Scholar
- 13.Mäkinen, E.: On contect-free derivations. PhD thesis, Acta Universitatis Tamperensis (1985)Google Scholar
- 14.Minsky, M.L.: Computation: Finite and Infinite Machines. In: Automatic computation. Prentice-Hall, Englewood Cliffs (1967)Google Scholar