The compaction of acyclic terms
Si trova su / Altri legami
The compaction of acyclic terms is proposed as a dynamic memory management operation for distributed symbolic computation. Compaction is defined here as the minimisation of term graphs, to give maximal structure–sharing. A simple transformation is described to show this problem equivalent to the minimisation of finite automata
| # | Istituto/Sede | Collocazione | Inventario patrimoniale |
|---|---|---|---|
| Area della ricerca di Genova, Servizio di Documentazione Scientifica | Sede di Genova |
