摘要
借助有限字母表上完备的度量空间(Profinite拓扑空间),利用拓扑空间中的连续与一致连续函数对模糊有穷自动机识别的模糊正则语言予以刻画。提出闭包基、闭包子基以及Profinite拓扑空间中的(上半)下半连续函数的概念,证明在射有限字符集上存在唯一的拓扑以正则语言类为一个闭包子基,并讨论Profinite拓扑空间的(上半)下半连续函数与模糊正则语言之间的关系。
Using complete metric space（Profinite topological space） over a finite alphabet, we characterized fuzzy regular languages recognized by fuzzy finite automata with respect to continuous and uniformly continuous functions. We introduced the notions such as closure base, cloure subbase and the （upper） lower semi-continuous functional, and showed the family of all regular languages being a cloure subbase of just one topology on profinite words. And then we investigated the relationship between （upper） lower semi-continuous functional and fuzzy regular languages.
出处
《模糊系统与数学》
CSCD
北大核心
2015年第4期80-85,共6页
Fuzzy Systems and Mathematics
基金
国家自然科学基金资助项目(11271237
11301316
11301321)
安庆师范学院青年科研基金资助项目(KJ201413
KJ201214)
