PROOF OF A FUZZY REGULAR LANGUAGE THEOREM BY USING LEVEL SETS—A NOTE

Abstract

Fuzzy languages and level sets are defined and illustrated by examples. Properties of level sets are presented. A fuzzy regular language theorem may be proved through the use of the properties of level sets. Level sets offer what appears to be a useful tool in theorem proving in fuzzy languages, pictorial databases, natural language translation and processing, and many others. Through the use of level sets, results obtained in formal languages may be used in fuzzy languages and related areas.

Citation

LEE, E.T. (1987), "PROOF OF A FUZZY REGULAR LANGUAGE THEOREM BY USING LEVEL SETS—A NOTE", Kybernetes, Vol. 16 No. 3, pp. 187-188. https://doi.org/10.1108/eb005768