On the recognizability of fuzzy languages II

被引：17

作者：

Bozapalidis, Symeon ^{[1
]}

Louscou-Bozapalidou, Olympia

机构：

[1] Aristotle Univ Thessaloniki, Dept Math, Thessaloniki 54124, Greece

[2] Tech Inst W Macedonia, Sect Math & Informat, Koila, Kozani, Greece

来源：

FUZZY SETS AND SYSTEMS | 2008年 / 159卷 / 01期

关键词：

fuzzy automata;

D O I：

10.1016/j.fss.2007.07.009

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

It is shown that a fuzzy language is recognized by a finite monoid iff it has finitely many right derivatives iff it has finitely many left derivatives. Finally we show that the behaviors of Lukasiewicz automata have the above properties. (c) 2007 Elsevier B.V. All rights reserved.

引用

页码：107 / 113

页数：7