指導教授：劉長遠臺灣大學：資訊工程學研究所林建旻Lin, Chien-MinChien-MinLin2014-11-262018-07-052014-11-262018-07-052014http://ntur.lib.ntu.edu.tw//handle/246246/261436在此篇論文中，我們使用L系統建模複雜度方法來計算上下文相關文法的複雜度。由於在現有文獻中已被證明出目前並沒有一般性的演算法用以計算上下文相關文法的複雜度，所以我們選擇了幾個常見的上下文相關文法例子來實作，為此我們改進了先前的L系統建模複雜度方法，使其能夠處理任意長度的符號序列。This article discusses how to apply the L-system modeling complexity method to context-sensitive sequences. Since it is proved that there exists no general calculation method to compute the entropy of context-sensitive languages, we choose some common context-sensitive languages and analyze them case by case. For that purpose, we extend the capability of the modeling complexity method in previous work. Our method can deal with arbitrary length sequences.Ch1 Introduction (1) 　　1.1 The complexity of the L-system (1) 　　1.2 Preliminary (2) 　　1.3 Other Applications (12) Ch2 The Complexity of Context-Sensitive Sequences (14) Ch3 Extension (31) Ch4 Summary (34) A Code (36) Bibliography (38)1538957 bytesapplication/pdf論文公開時間：2019/03/08論文使用權限：同意無償授權結構複雜度樹狀結構表示法序列上下文相關文法L 系統thesishttp://ntur.lib.ntu.edu.tw/bitstream/246246/261436/1/ntu-103-R98922120-1.pdf