任意符號序列之語法敏感複雜度

Abstract

本論文使用Lindenmayer系統來建造文本序列的樹狀結構，並且導 出其複雜度，此複雜度為文本序列的結構複雜度。我們使用不同編碼 方法將文本序列編碼成二進位字串，並且比較不同編碼方法所產生之 字串的複雜度。此外，我們也比較了兩個其他複雜度之計量方法，並 且探討如何利用我們的方法來偵測通訊異常的可能性。

This work uses the L-system to construct a tree structure for text sequence and derives its complexity [6]. This complexity serves as a measure of structural complexity of text sequence. We encode text sequences into binary strings and analyze their complexity between different encoding methods. Besides we compare our methods to other measures of complexity [4, 12] and study the possibility of anomaly detection in Network by Kullback–Leibler divergence.