Using Adaptive Automata In Grammar-Based Text Compression To Identify Frequent Substrings

Compression techniques allow reduction in the data storage space required by applications dealing with
large amount of data by increasing the information entropy of its representation. This paper presents an
adaptive rule-driven device - the adaptive automata - as the device to identify recurring sequences of
symbols to be compressed in a grammar-based lossless data compression scheme.