Wikipedia

Sequitur algorithm

This is an old revision of this page, as edited by 198.54.202.242 (talk) at 19:51, 9 February 2005. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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

Template:Substub

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