对字符串的最大解析

Proceedings DCC '97. Data Compression Conference Pub Date : 1997-03-25 DOI:10.1109/DCC.1997.582052

H. Helfgott, M. Cohn

{"title":"对字符串的最大解析","authors":"H. Helfgott, M. Cohn","doi":"10.1109/DCC.1997.582052","DOIUrl":null,"url":null,"abstract":"Given a sequence, we consider the maximum number of distinct phrases in any parsing; this definition of complexity is invariant under string reversal. We show that the Lempel-Ziv (1976, 1978) parsings can vary under reversal by a factor on the order of the log of the sequence length. We give two interpretations of maximal parsing, show that they are not equivalent and that one lacks a plausible monotonicity property.","PeriodicalId":403990,"journal":{"name":"Proceedings DCC '97. Data Compression Conference","volume":"410 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"On maximal parsings of strings\",\"authors\":\"H. Helfgott, M. Cohn\",\"doi\":\"10.1109/DCC.1997.582052\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Given a sequence, we consider the maximum number of distinct phrases in any parsing; this definition of complexity is invariant under string reversal. We show that the Lempel-Ziv (1976, 1978) parsings can vary under reversal by a factor on the order of the log of the sequence length. We give two interpretations of maximal parsing, show that they are not equivalent and that one lacks a plausible monotonicity property.\",\"PeriodicalId\":403990,\"journal\":{\"name\":\"Proceedings DCC '97. Data Compression Conference\",\"volume\":\"410 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1997-03-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings DCC '97. Data Compression Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DCC.1997.582052\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings DCC '97. Data Compression Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DCC.1997.582052","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

给定一个序列，我们考虑在任何解析中不同短语的最大数目;这个复杂度的定义在字符串反转下是不变的。我们证明了Lempel-Ziv(1976,1978)解析可以在序列长度的对数量级上的因子反转下变化。给出了极大解析的两种解释，证明它们是不等价的，其中一种缺乏似是而非的单调性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

On maximal parsings of strings

Given a sequence, we consider the maximum number of distinct phrases in any parsing; this definition of complexity is invariant under string reversal. We show that the Lempel-Ziv (1976, 1978) parsings can vary under reversal by a factor on the order of the log of the sequence length. We give two interpretations of maximal parsing, show that they are not equivalent and that one lacks a plausible monotonicity property.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings DCC '97. Data Compression Conference

自引率

0.00%

发文量

期刊最新文献

Robust image coding with perceptual-based scalability Image coding based on mixture modeling of wavelet coefficients and a fast estimation-quantization framework Region-based video coding with embedded zero-trees Progressive Ziv-Lempel encoding of synthetic images Compressing address trace data for cache simulations