eA. Proof The complexity is straightforward. REFERENCES.pdf

下载文档

1
0
约 8页
2017-04-13 发布于江苏
举报
版权申诉
保障服务

eA. Proof The complexity is straightforward. REFERENCES.pdf

1、本文档共8页，可阅读全部内容。
2、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。
3、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。

eA. Proof The complexity is straightforward. REFERENCES

1900 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 51, NO. 5, MAY 2005 Proposition 11: Algorithm PERIODIC-MF-TRIES computes from the automata Ak accepting Fact(k)(y) the set of tries accepting the min- imal periodic forbidden words of y. Proof: Again, the proof is an extension of the correctness proof of the computation of the minimal forbidden words of a word from the factor automaton of y (see [10, Sec. 6.5, pp. 182] or [7]). Proposition 12: Algorithm PERIODIC SUFFIX AUTOMATON fol- lowed by algorithm PERIODIC-MF-TRIES runs in time O(jyj T log jAj). Proof: The complexity is straightforward. REFERENCES [1] J. Moon and B. Brickner, “Maximum transition run codes for data storage,” IEEE Trans. Magn., vol. 32, no. 5, pp. 3992–3994, Sep. 1996. [2] A. Wijngaarden and K. S. Immink, “Maximum run-length limited codes with error control properties,” IEEE J. Select. Areas Commun., vol. 19, no. 4, pp. 602–611, Apr. 2001. [3] J. C. de Souza, B. H. Marcus, R. New, and B. A. Wilson, “Constrained systems with unconstrained positions,” IEEE Trans. Inf. Theory, vol. 48, no. 4, pp. 866–879, Apr. 2002. [4] B. H. Marcus, R. M. Roth, and P. H. Siegel, “Constrained systems and coding for recording channels,” inHandbook of Coding Theory, V. Pless and W. Huffman, Eds. Amsterdam, The Netherlands: North Holland, 1998, vol. II, ch. 20, pp. 1635–1764. [5] B. E. Moision and P. H. Siegel, “Periodic-finite-type shift spaces,” in Proc. IEEE Int. Symp. Information Theory, Washington, DC, Jun. 2001, p. 65. [6] M.-P. Béal, M. Crochemore, F. Mignosi, A. Restivo, and M. Sciortino, “Computing forbidden words of regular languages,” Fundamenta Infor- maticae, vol. 56, no. 1,2, pp. 121–135, 2003. [7] M. Crochemore, F. Mignosi, and A. Restivo, “Automata and forbidden words,” Inf. Process. Lett., vol. 67, pp. 111–117, 1998. [8] M. Crochemore, F. Mignosi, A. Restivo, and S. Salemi, “Data compres- sion using antidictionaries,” Proc. IEEE (Special Issue on Lossless Data Compression), vol. 88, no. 11, pp. 175