| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 391430 | Fuzzy Sets and Systems | 2006 | 18 Pages |
Abstract
We consider finite automata over semirings and quemirings accepting finite and infinite words, respectively. We obtain Kleene theorems for fuzzy languages consisting of finite and infinite words. Furthermore, we introduce regular fuzzy grammars and linear fuzzy systems and we show that both of them specify the class of recognizable fuzzy languages consisting of finite and infinite words.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
