Fuzzy regular languages over finite and infinite words
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. (C) 2006 Elsevier B.V. All rights reserved.
infinite words quemirings fuzzy languages fuzzy semiring formal series