| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 390876 | Fuzzy Sets and Systems | 2008 | 7 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
