1.
Stefan, G.; Benea, R.
Connex memories and rewriting systems Proceedings Article
In: MELECON '98. 9th Mediterranean Electrotechnical Conference. Proceedings (Cat. No.98CH36056), pp. 1299-1303 vol.2, 1998.
Abstract | Links | BibTeX | Tags: Gold;Computer architecture;Petroleum
@inproceedings{699446,
title = {Connex memories and rewriting systems},
author = {G. Stefan and R. Benea},
doi = {10.1109/MELCON.1998.699446},
year = {1998},
date = {1998-05-01},
booktitle = {MELECON '98. 9th Mediterranean Electrotechnical Conference. Proceedings (Cat. No.98CH36056)},
volume = {2},
pages = {1299-1303 vol.2},
abstract = {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.},
keywords = {Gold;Computer architecture;Petroleum},
pubstate = {published},
tppubtype = {inproceedings}
}
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.