On fuzzy recognizers

D. S. Malik; John N. Mordeson

doi:10.1108/03684929910253234

On fuzzy recognizers

D. S. Malik, John N. Mordeson

Department of Mathematics

Research output: Contribution to journal › Article › peer-review

7 Scopus citations

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 M_A such that L(M_A) = A. We lay groundwork to determine rational decompositions of recognizable sets.

Original language	English (US)
Pages (from-to)	47-60
Number of pages	14
Journal	Kybernetes
Volume	28
Issue number	1
DOIs	https://doi.org/10.1108/03684929910253234
State	Published - Jan 1 1999

All Science Journal Classification (ASJC) codes

Control and Systems Engineering
Theoretical Computer Science
Computer Science (miscellaneous)
Engineering (miscellaneous)
Social Sciences (miscellaneous)

Access to Document

10.1108/03684929910253234

Cite this

@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, {D. S.} and Mordeson, {John N.}",

year = "1999",

month = jan,

day = "1",

doi = "10.1108/03684929910253234",

language = "English (US)",

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, D. S.

AU - Mordeson, John N.

PY - 1999/1/1

Y1 - 1999/1/1

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

U2 - 10.1108/03684929910253234

DO - 10.1108/03684929910253234

M3 - Article

AN - SCOPUS:0033241445

VL - 28

SP - 47

EP - 60

JO - Kybernetes

JF - Kybernetes

SN - 0368-492X

IS - 1

ER -

On fuzzy recognizers

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this