首页 | 本学科首页   官方微博 | 高级检索  
     

关于 Fuzzyω正则语言的一个注记
引用本文:莫智文,柏明强. 关于 Fuzzyω正则语言的一个注记[J]. 模糊系统与数学, 2004, 18(Z1): 275-278
作者姓名:莫智文  柏明强
作者单位:四川师大学数学与软件科学学院,四川,成都,610066
基金项目:国家自然科学基金,四川省科技计划
摘    要:通过引入ω-Nerode等价关系,fuzzy前逆缀ω-语言,闭左逆语言等概念来研究语言的化数性质,得到了(1)fuzzyω正则语言可由一些具有有限指标集的等价类来表示;(2)fuzzy前逆缀ω-语言是fuzzyω正则语言iff由L定义的ω-Nerode等价关系的指标集是有限的.

关 键 词:Fuzzyω有限态自动机  fuzzyω正则语言  fuzzy左同余关系

Note on Fuzzy ω-Regular Languages
MO Zhi-wen,BAI Ming-qiang. Note on Fuzzy ω-Regular Languages[J]. Fuzzy Systems and Mathematics, 2004, 18(Z1): 275-278
Authors:MO Zhi-wen  BAI Ming-qiang
Abstract:In this paper the notion of the ω-Nerode equivalence relation over ∑* is introduced, and the concepts of fuzzy prefix-inverse-related ω-language over ∑ and left-inverse-closed languge. On this base,the following results are obtained:fuzzy prefix-inverse-related ω-language over ∑ is fuzzyω-regular language if and only if the index of the ω-Nerode equivalence relati defined by L is finite,fuzzy ω-regular language over ∑ is represented by the union of some equivalence classes of some equivalence relation with finite index, left-invariant over ∑ω. Thus in a class of ω-language with prefix-inverse-related ω-language or left-inverse-closed ω-language, the characteristics of fuzzyω-regular language is given from algebra and set viewpoints. This is a foundation for deep researches on fuzzy finite-state automaton and fuzzy regular language.
Keywords:Fuzzy ω-finite-state Automaton  Fuzzy ω-regular Language  Fuzzy Left Congruence Equivalence Relation
本文献已被 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号