On fuzzy recognizers
Abstract
In this paper, we define and examine the concept of a fuzzy recognizer. If L(M) is the language recognized by an incomplete fuzzy recognizer M, we show that there is a completion M of M such that L(M) = L(M). We also show that if A is a recognizable set of words, then there is a complete accessible fuzzy recognizer MA such that L(MA) = A. We lay groundwork to determine rational decompositions of recognizable sets.
Keywords
Citation
Malik, D.S. and Mordeson, J.N. (1999), "On fuzzy recognizers", Kybernetes, Vol. 28 No. 1, pp. 47-60. https://doi.org/10.1108/03684929910253234
Publisher
:MCB UP Ltd
Copyright © 1999, MCB UP Limited