2008
DOI: 10.1016/j.ins.2008.07.009
|View full text |Cite
|
Sign up to set email alerts
|

Computing behavior of finite fuzzy machines – Algorithm and its application to reduction and minimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
16
0

Year Published

2008
2008
2017
2017

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 22 publications
(16 citation statements)
references
References 25 publications
0
16
0
Order By: Relevance
“…This is because the method has been applied in a variety of domains such as geochemical, ecological, and mineralogical indicators in environment science, machine behaviors in computer science, marine safety modeling, port security assessment, etc. ( 10,24,26,27 ) Therefore, the approach has been proven useful for acquiring fuzzy conclusions. The process of the min‐max approach is exhibited in Fig.…”
Section: Methodsmentioning
confidence: 99%
“…This is because the method has been applied in a variety of domains such as geochemical, ecological, and mineralogical indicators in environment science, machine behaviors in computer science, marine safety modeling, port security assessment, etc. ( 10,24,26,27 ) Therefore, the approach has been proven useful for acquiring fuzzy conclusions. The process of the min‐max approach is exhibited in Fig.…”
Section: Methodsmentioning
confidence: 99%
“…A»X = B (9) where A = {aij)mxn is a matrix with the coefficients of the system (8), B = (fcj)mxi is the right hand side of (8) and X = (xj) i xn is a matrix with all unknown values of (8) Types of Solutions for the a FLSE Definition 9 X° = (x^)"xi with x^ G [0,1] and j = 1,M is called point solution of the system (9) iiA»X° = B holds.…”
Section: Max-min Fuzzy Linear System Of Equationsmentioning
confidence: 99%
“…Computing Behavior Matrix and Minimization of Finite Fuzzy Machines (FFM) [7] [11], [12], [8] Definition 20 A finite fuzzy machine (FFM) is a quadruple ^ = (X, g, 7, ^), where: • X, g, y are nonempty finite sets of input letters, states and output letters, respectively. • ^ is the set of transition-output matrices of ^, that determines its stepwise behavior.…”
Section: Definition 19mentioning
confidence: 99%
“…From a different point of view, fuzzy automata with membership values in a complete residuated lattice were studied by Ignjatović , Ć irić and their coworkers [19][20][21][22]39,41,42,44,86,87]. Fuzzy automata taking membership values in a lattice-ordered monoid were investigated by Li and others [55,56,58,60], fuzzy automata over other types of lattices were the subject of [3,31,57,59,50,51,[68][69][70][71], and automata which generalize fuzzy automata over any type of lattices, as well as weighted automata over semirings, have been studied recently in [16,30,46]. During the decades, fuzzy automata and languages have gained wide field of application, including lexical analysis, description of natural and programming languages, learning systems, control systems, neural networks, knowledge representation, clinical monitoring, pattern recognition, error correction, databases, discrete event systems, and many other areas (cf., e.g., [32,36,49,64,70]).…”
Section: Introductionmentioning
confidence: 99%