完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.author | Lai, Y. T. | |
| dc.contributor.author | Tsai, Shi-Chun | |
| dc.date.accessioned | 2009-06-02T06:21:14Z | |
| dc.date.accessioned | 2020-05-25T06:36:58Z | - |
| dc.date.available | 2009-06-02T06:21:14Z | |
| dc.date.available | 2020-05-25T06:36:58Z | - |
| dc.date.issued | 2006-10-25T07:32:32Z | |
| dc.date.submitted | 2000-12-08 | |
| dc.identifier.uri | http://dspace.lib.fcu.edu.tw/handle/2377/2518 | - |
| dc.description.abstract | We give a new and simple proof of a key lemma on the rank of a matrix in Leung's paper [3], where he showed there exists a family of nondeterministic nite automata fAng, with n states and exponential ambi- guity, such that any smallest equivalent polynomially ambiguous nite automaton has 2n 1 states. | |
| dc.description.sponsorship | 中正大學,嘉義縣 | |
| dc.format.extent | 3p. | |
| dc.format.extent | 123198 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | zh_TW | |
| dc.relation.ispartofseries | 2000 ICS會議 | |
| dc.subject | nondeterministic automata | |
| dc.subject | automata theory | |
| dc.subject | ambiguity | |
| dc.subject.other | Languages and Complexity Theory | |
| dc.title | A Note on the Ambiguity of Finite Automata | |
| 分類: | 2000年 ICS 國際計算機會議 | |
文件中的檔案：
| 檔案 | 描述 | 大小 | 格式 | |
|---|---|---|---|---|
| ce07ics002000000026.pdf | 120.31 kB | Adobe PDF | 檢視/開啟 |
在 DSpace 系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。