Connex memories and rewriting systems
G. Stefan, R. Benea · 2002
The aim of this paper is to offer a theoretical framework for our concept of connex memory, initially introduced as a proposal for an efficient implementation of list-oriented programming languages. The Markov Algorithms and the Lindenmeyer Grammars offer the theoretical support for the main connex memory applications: the rewriting systems. We also introduce a parallel version (with multiple access) for the function of the connex memory. We call eco-chip a two dimensional cellular automaton used as support for a multiple accessed connex memory.