Jump to content

Sequitur algorithm

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by 128.143.13.52 (talk) at 18:06, 2 December 2004 (Sequitur is a grammar-based algorithm.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Sequitur is an algorithm that uses a grammar formed from a sequence of discrete symbols to represent a problem. This algorithm is used frequently in data compression software applications.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Sequitur_algorithm&oldid=10105502"