模糊系统与数学
模糊繫統與數學
모호계통여수학
FUZZY SYSTEMS AND MATHEMATICS
2004年
z1期
275-278
,共4页
Fuzzyω有限态自动机%fuzzyω正则语言%fuzzy左同余关系
Fuzzyω有限態自動機%fuzzyω正則語言%fuzzy左同餘關繫
Fuzzyω유한태자동궤%fuzzyω정칙어언%fuzzy좌동여관계
Fuzzy ω-finite-state Automaton%Fuzzy ω-regular Language%Fuzzy Left Congruence Equivalence Relation
通过引入ω-Nerode等价关系,fuzzy前逆缀ω-语言,闭左逆语言等概念来研究语言的化数性质,得到了(1)fuzzyω正则语言可由一些具有有限指标集的等价类来表示;(2)fuzzy前逆缀ω-语言是fuzzyω正则语言iff由L定义的ω-Nerode等价关系的指标集是有限的.
通過引入ω-Nerode等價關繫,fuzzy前逆綴ω-語言,閉左逆語言等概唸來研究語言的化數性質,得到瞭(1)fuzzyω正則語言可由一些具有有限指標集的等價類來錶示;(2)fuzzy前逆綴ω-語言是fuzzyω正則語言iff由L定義的ω-Nerode等價關繫的指標集是有限的.
통과인입ω-Nerode등개관계,fuzzy전역철ω-어언,폐좌역어언등개념래연구어언적화수성질,득도료(1)fuzzyω정칙어언가유일사구유유한지표집적등개류래표시;(2)fuzzy전역철ω-어언시fuzzyω정칙어언iff유L정의적ω-Nerode등개관계적지표집시유한적.
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.