形式语言的范畴计算模型研究

摘要

This paper analyzes briefly limitations of traditional computation model for processing uncertain problems, makes category computation models of formal language by category theory, further studies objects relationship between lexicon category and grammar category by using bifunctor as a tool, and effectively solves uncertain computation problem of formal language recognition, which provides a kind of new thought for computation model to process uncertain problems.%分析了传统计算模型处理不确定性问题的局限性,并应用范畴理论建立形式语言的范畴计算模型,以双函子为工具深入研究了字范畴模型与形式文法范畴模型之间象元的关联,有效解决了形式语言识别的不确定性计算问题,为计算模型处理不确定性问题提供了一种新的思路.