| 汉字有穷自动机的优化及相关算法研究 |
| |
| 引用本文： | 张友红,谷文祥,殷明浩.汉字有穷自动机的优化及相关算法研究[J].东北师大学报(自然科学版),2006,38(2):22-26. |
| |
| 作者姓名： | 张友红 谷文祥 殷明浩 |
| |
| 作者单位： | 佛山科学技术学院理学院,广东,佛山,528000;东北师范大学计算机学院,吉林,长春,130024 |
| |
| 基金项目： | 中国科学院资助项目，东北师范大学校科研和教改项目 |
| |
| 摘 要： | 在研究了汉字有穷自动机可以表示的语言基础上,引进了最小状态汉字有穷自动机和可区分状态的概念,并利用汉字有穷自动机间的等价性和可区分状态的性质,给出了一种最小化算法,实验证明,此算法优于最小化汉字有穷自动机算法.
|
| 关 键 词： | 最小汉字有穷自动机 可区分状态 等价性 |
| 文章编号： | 1000-1832（2006）02-0022-05 |
| 收稿时间： | 2006-01-09 |
| 修稿时间： | 2006年1月9日 |
Optimization of Chinese character finite automaton and the research relenvant to its algorithm |
| |
| ZHANG You-hong,GU Wen-xiang,YIN Ming-hao.Optimization of Chinese character finite automaton and the research relenvant to its algorithm[J].Journal of Northeast Normal University (Natural Science Edition),2006,38(2):22-26. |
| |
| Authors: | ZHANG You-hong GU Wen-xiang YIN Ming-hao |
| |
| Institution: | 1. College of Scienee,Foshan College of Science and Technology,Foshan 528000,China; 2. College of Computer, Northeast Normal University, Changchun 130024, China |
| |
| Abstract: | Based on the work having been done, definitions of minimum Chinese characters finite automata and distinguishable states have been advanced in the paper. And using these conceptions and the equivalence between finite autornatas, an algorithm is advanced in the paper. The experiments have proved that the algorithm is better in efficiency than the one advanced . |
| |
| Keywords: | minimum Chinese characters finite automata distinguishable states equivalence |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
