請用此 Handle URI 來引用此文件：
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/5489完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.advisor | 劉長遠(Cheng-Yuan Liou) | |
| dc.contributor.author | Chien-Min Lin | en |
| dc.contributor.author | 林建旻 | zh_TW |
| dc.date.accessioned | 2021-05-15T18:00:28Z | - |
| dc.date.available | 2019-03-08 | |
| dc.date.available | 2021-05-15T18:00:28Z | - |
| dc.date.copyright | 2014-03-08 | |
| dc.date.issued | 2014 | |
| dc.date.submitted | 2014-01-16 | |
| dc.identifier.citation | [1] F. P. Kaminger. The noncomputability of the channel capacity of context-sensitive languages. Information and Control, 17(175), 1970.
[2] P. Landweber. Decision problems on phrase structure grammars. IEEE Trans. Electron. Comput., 13(354), 1964. [3] Aristid Lindenmayer. Mathematical models for cellular interactions in development. Part I and II. Journal of Theoretical Biology, 18(3):280–315, 1968. [4] Wikipedia. L-system — Wikipedia, the free encyclopedia, 2012. (http://en.wikipedia.org/wiki/L-system). [5] Cheng-Yuan Liou, Tai-Hei Wu, and Chia-Ying Lee. Modeling complexity in musical rhythm. Complexity, 15(4):19–30, 2010. [6] R. Badii and A. Politi. Complexity: Hierarchical structures and scaling in physics, volume 6. Cambridge University Press, 1999. [7] Werner Kuich. On the entropy of context-free languages. Information and Control, 16(2):173–200, 1970. [8] Cheng-Yuan Liou, Shen-Han Tseng, Wei-Chen Cheng, and Huai-Ying Tsai. Structural complexity of dna sequence. Comp. Math. Methods in Medicine, 2013. [9] Cheng-Yuan Liou, Daw-Ran Liou, Alex A. Simak, and Bo-Shiang Huang. Syntactic sensitive complexity for symbol-free sequence. IScIDE Bejing, LNCS, 8261:15–22, 2013. [10] Roger Penrose. Pentaplexity a class of non-periodic tilings of the plane. The Mathematical Intelligencer, 2:32–37, 1979. [11] Marek Fiser. Marek’s l-systems, 2014. (http://malsys.cz). | |
| dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/5489 | - |
| dc.description.abstract | 在此篇論文中，我們使用L系統建模複雜度方法來計算上下文相關文法的複雜度。由於在現有文獻中已被證明出目前並沒有一般性的演算法用以計算上下文相關文法的複雜度，所以我們選擇了幾個常見的上下文相關文法例子來實作，為此我們改進了先前的L系統建模複雜度方法，使其能夠處理任意長度的符號序列。 | zh_TW |
| dc.description.abstract | 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. | en |
| dc.description.provenance | Made available in DSpace on 2021-05-15T18:00:28Z (GMT). No. of bitstreams: 1 ntu-103-R98922120-1.pdf: 1538957 bytes, checksum: bdd2e16aa13991b7ccff32e10e0fd826 (MD5) Previous issue date: 2014 | en |
| dc.description.tableofcontents | 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) | |
| dc.language.iso | en | |
| dc.title | 上下文相關的符號序列複雜度 | zh_TW |
| dc.title | The Complexity of Context-Sensitive Sequences | en |
| dc.type | Thesis | |
| dc.date.schoolyear | 102-1 | |
| dc.description.degree | 碩士 | |
| dc.contributor.oralexamcommittee | 呂育道,彭智楹,黃昭綺 | |
| dc.subject.keyword | 結構複雜度,樹狀結構表示法,序列,上下文相關文法,L 系統, | zh_TW |
| dc.subject.keyword | Structural complexity,Tree representation,Sequence,Context- sensitive grammar,L-system, | en |
| dc.relation.page | 39 | |
| dc.rights.note | 同意授權(全球公開) | |
| dc.date.accepted | 2014-01-17 | |
| dc.contributor.author-college | 電機資訊學院 | zh_TW |
| dc.contributor.author-dept | 資訊工程學研究所 | zh_TW |
| 顯示於系所單位： | 資訊工程學系 | |
文件中的檔案：
| 檔案 | 大小 | 格式 | |
|---|---|---|---|
| ntu-103-1.pdf | 1.5 MB | Adobe PDF | 檢視/開啟 |
系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。