汉字双向有穷自动机的研究  

Chinese Character Input Processing Models Based on Two-way Finite Automaton

作　　者：蔡增玉[1] 谷文祥[1] 

机构地区：[1]东北师范大学计算机学院,吉林长春130024

出　　处：《中文信息学报》2005年第3期40-44,共5页Journal of Chinese Information Processing

基　　金：国家自然科学基金资助项目 (6 99730 12 ) ;教育部重点项目 (0 2 0 90 )

摘　　要：汉字的计算机输入是中文信息处理的关键问题之一,而汉字计算机输入的数学模型对汉字的计算机输入的研究有重要的意义。本文从自动机理论的角度对汉字输入的数学模型进行了研究,把控制操作引入了输入模型,并给出确定汉字双向有穷自动机和不确定汉字双向有穷自动机的模型。新的模型较之以前的数学模型,能刻画出汉字输入的控制操作,表达能力进一步增强,是对以前汉字键盘输入数学模型的推广。Chinese character inputting play a key role in the Chinese information processing, and the input model is very important for the study on the Chinese character input. This paper makes some studied in the building of Chinese character input modes based on automata theoretic, handles the control operation in the input model, and introduces the concepts of two-way deterministic Chinese finite automaton and two-way nondeterministic Chinese finite automaton. Compared to the previous models, our models can handle the control operations in the process of inputting character, and have the more expression ability. So our input models can be treated as the expansion of the previous moedls.

关 键 词：计算机应用 中文信息处理 汉字输入 数学模型 双向有穷自动机 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]