MODELING SEQUENCES USING GRAMMARS AND AUTOMATA
| dc.contributor.author | Nevill-Manning, Craig G. | eng |
| dc.contributor.author | Witten, Ian H. | eng |
| dc.contributor.author | Maulsby, David L. | eng |
| dc.date.accessioned | 2008-02-27T22:30:32Z | |
| dc.date.available | 2008-02-27T22:30:32Z | |
| dc.date.computerscience | 1999-05-27 | eng |
| dc.date.issued | 1994-02-01 | eng |
| dc.description.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. | eng |
| dc.description.notes | We are currently acquiring citations for the work deposited into this collection. We recognize the distribution rights of this item may have been assigned to another entity, other than the author(s) of the work.If you can provide the citation for this work or you think you own the distribution rights to this work please contact the Institutional Repository Administrator at digitize@ucalgary.ca | eng |
| dc.identifier.department | 1994-536-05 | eng |
| dc.identifier.doi | http://dx.doi.org/10.11575/PRISM/31170 | |
| dc.identifier.uri | http://hdl.handle.net/1880/46200 | |
| dc.language.iso | Eng | eng |
| dc.publisher.corporate | University of Calgary | eng |
| dc.publisher.faculty | Science | eng |
| dc.subject | Computer Science | eng |
| dc.title | MODELING SEQUENCES USING GRAMMARS AND AUTOMATA | eng |
| dc.type | unknown | |
| thesis.degree.discipline | Computer Science | eng |