An Efficient Pattern Matching Algorithm on a Subclass of Context Free Grammars.
Developments in Language Theory, 8th International Conference, DLT 2004, Auckland, New Zealand, December 13-17, 2004, Proceedings,
Lecture Notes in Computer Science Vol.3340, pp.225-236
(2004), [peer-reviewed]
Event Date:
December 13-17, 2004
Abstract / 概要
There is a close relationship between formal language theory and data compression. Since 1990’s various types of grammar-based text compression algorithms have been introduced. Given an input string, a grammar-based text compression algorithm constructs a…