Please use this identifier to cite or link to this item:
Authors: Nevill-Manning, Craig G.
Witten, Ian H.
Maulsby, David L.
Keywords: Computer Science
Issue Date: 1-Feb-1994
Abstract: Inference of structure from a sequence is useful for explanation, prediction, and compression. One technique described here infers a grammar from a sequence, and presents plausible explanations of how a sequence is structured. It has the added advantage of producing small explanations, and performs extremely well as a data compression technique. A second technique infers an automaton from a sequence, identifying branches, loops, recursive and non-recursive procedures. The two techniques have complementary strengths and weakness, and an inference problem which stymies each technique individually is shown to be amenable to a combination of the two.
Appears in Collections:Witten, Ian
Maulsby, David

Files in This Item:
File Description SizeFormat 
1994-536-05.pdf1.87 MBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.