On the recognizability of fuzzy languages II

Authors:
Symeon Bozapalidis;Olympia Louscou-Bozapalidou
Affiliations:
Department of Mathematics, Aristotle University of Thessaloniki, 54124 Thessaloniki, Greece;Section of Mathematics and Informatics, Technical Institute of West Macedonia, Koila, Kozani, Greece
Venue:
Fuzzy Sets and Systems
Year:
2008

Citing 3
Cited 4

A first course in fuzzy logic

A first course in fuzzy logic
Automata, Languages, and Machines

Automata, Languages, and Machines
Fuzzy regular languages over finite and infinite words

Fuzzy Sets and Systems

Fuzzy tree language recognizability

Fuzzy Sets and Systems
Myhill--Nerode type theory for fuzzy languages and automata

Fuzzy Sets and Systems
Determinization of weighted finite automata over strong bimonoids

Information Sciences: an International Journal
An improved algorithm for determinization of weighted and fuzzy automata

Information Sciences: an International Journal

Quantified Score

Hi-index	0.22

Visualization

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.