On fuzzy recognizers

Davender S. Malik, John N. Mordeson

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

In this paper, we define and examine the concept of a fuzzy recognizer. If L(M) is the language recognized by an incompkte 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.

Original languageEnglish
Pages (from-to)47-60
Number of pages14
JournalKybernetes
Volume28
Issue number1
StatePublished - 1999

Fingerprint

Levenberg-Marquardt
Decomposition
language
Completion
Decompose

All Science Journal Classification (ASJC) codes

  • Human-Computer Interaction
  • Control and Systems Engineering

Cite this

Malik, D. S., & Mordeson, J. N. (1999). On fuzzy recognizers. Kybernetes, 28(1), 47-60.

On fuzzy recognizers. / Malik, Davender S.; Mordeson, John N.

In: Kybernetes, Vol. 28, No. 1, 1999, p. 47-60.

Research output: Contribution to journalArticle

Malik, DS & Mordeson, JN 1999, 'On fuzzy recognizers', Kybernetes, vol. 28, no. 1, pp. 47-60.
Malik DS, Mordeson JN. On fuzzy recognizers. Kybernetes. 1999;28(1):47-60.
Malik, Davender S. ; Mordeson, John N. / On fuzzy recognizers. In: Kybernetes. 1999 ; Vol. 28, No. 1. pp. 47-60.
@article{c8084f990f4d4924adb61d5cb2428de3,
title = "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 incompkte 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.",
author = "Malik, {Davender S.} and Mordeson, {John N.}",
year = "1999",
language = "English",
volume = "28",
pages = "47--60",
journal = "Kybernetes",
issn = "0368-492X",
publisher = "Emerald Group Publishing Ltd.",
number = "1",

}

TY - JOUR

T1 - On fuzzy recognizers

AU - Malik, Davender S.

AU - Mordeson, John N.

PY - 1999

Y1 - 1999

N2 - In this paper, we define and examine the concept of a fuzzy recognizer. If L(M) is the language recognized by an incompkte 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.

AB - In this paper, we define and examine the concept of a fuzzy recognizer. If L(M) is the language recognized by an incompkte 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.

UR - http://www.scopus.com/inward/record.url?scp=0033241445&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0033241445&partnerID=8YFLogxK

M3 - Article

VL - 28

SP - 47

EP - 60

JO - Kybernetes

JF - Kybernetes

SN - 0368-492X

IS - 1

ER -