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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.