AIRCC's International Journal of Computer Science and Information Technology

Open Access Open Access  Restricted Access Subscription Access

Using Adaptive Automata in Grammar-Based Text Compression to Identify Frequent Substrings


Affiliations
1 Escola Politecnica da Universidade de Sao Paulo, Sao Paulo, Brazil
 

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.

Keywords

Adaptive Automata, Grammar Based Data Compression.
User
Notifications
Font Size


  • Using Adaptive Automata in Grammar-Based Text Compression to Identify Frequent Substrings

Abstract Views: 414  |  PDF Views: 199

Authors

Newton Kiyotaka Miura
Escola Politecnica da Universidade de Sao Paulo, Sao Paulo, Brazil
Joao Jose Neto
Escola Politecnica da Universidade de Sao Paulo, Sao Paulo, Brazil

Abstract


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.

Keywords


Adaptive Automata, Grammar Based Data Compression.

References