| 直线链码和形式语言 |
| |
| 引用本文： | 吴立德,翁富良.直线链码和形式语言[J].复旦学报(自然科学版),1987(2). |
| |
| 作者姓名： | 吴立德 翁富良 |
| |
| 作者单位： | 复旦大学计算机科学系，复旦大学计算机科学系 八四级硕士研究生. |
| |
| 摘 要： | 本文给出并比较了有关直线链码性质的几种表述,证明了直线链码的一个性质:若将全体直线链码所组成的集CL看作是{0,1,2,3,4,5,6,7}上的语言,则CL是上下文有关的.由于CL不是上下文无关语言,直线链码集CL在语言类中的归属就被完全确定了.
|
| 关 键 词： | 链码 直线段 上下文有关文法 线性有界自动机 |
CHAIN CODE FOR A LINE SEGMENT AND FORMAL LANGUAGE |
| |
| Wu Lide,Weng Fuliang.CHAIN CODE FOR A LINE SEGMENT AND FORMAL LANGUAGE[J].Journal of Fudan University(Natural Science),1987(2). |
| |
| Authors: | Wu Lide Weng Fuliang |
| |
| Institution: | Department of Computer Science |
| |
| Abstract: | In this paper, a concise expression for Freeman-Wu's criteria is given, and several expressions on the chain code of straight line are reviewed and compared. A property on the chain code of straight line segment is proved. It is shown that, the chain code set for straight line segments, as a language CL on {0,1,2,3,4,5,6,7}, is a context-sensitive language. Since it has been already proved that CL is not a context-free language, the position of CL in the language classes is thus entirely determined. |
| |
| Keywords: | chain code straight line segments context-sensitive grammar linear bounded automaton |
| 本文献已被 CNKI 等数据库收录！ |
|
