The Minimization of Spatially-Multiplexed Character Sets

The paper describes a technique for compacting
character sets in a digital computer while retaining 
fast access to individual bits.  It considers the problem
of minimizing the storage needed to contain 
such tables.  Reduction techniques are developed, and
the problem is shown to reduce to a covering problem.

CACM June, 1974

Gimpel, J. F.

parsing, lexical analysis,scanning,
string processing, spatial multiplexing

4.9

CA740603 JB January 17, 1978  3:31 PM

2643	5	2643
2643	5	2643
2643	5	2643
2706	5	2643
2643	6	2643