Automata theory is study of mathematical properties of abstract computing machine. One of the applications of finite automata is lexical analysis. Researchers proposed rough finite state automata or fuzzy automata as recognizer that accepts imprecise languages. It defines formal languages and decides if any string belongs to the language or not. We have proposed rough fuzzy (final) automata model in this article. This model recognizes rough fuzzy (final) languages. It is suitable as a lexical analyzer when the decision values are fuzzy or can be converted to fuzzy.
REFERENCES
1.
L. A.
Zadeh
, Info. Cont.
8
, 338
–353
(1965
).2.
Z.
Pawlak
, Int. J. Comp. Info. Scs.
11
(5
) 341
–355
(1982
).3.
D.
Dubois
and H.
Prade
, Int. J. Genl Sys.
17
(2-3
), 191
–209
(1990
).4.
A.
Mateescu
, A.
Salomaa
, Kai
Salomaa
and S.
Yu
, J. Univ. Comp. Sci.
1
(5
) 292
–311
(1995
).5.
A.
Choubey
and Ravi
K. M.
, J. Appl. Math Info.
27
(1
), 409
–417
(2009
).6.
G.
Paun
, L.
Polkowski
and A.
Skowron
, Fundamenta Informaticae
, 33
146
–162
(1998
).7.
S.
Basu
, Found. Compu. Decision Scs.
28
(2
) 129
–140
(2003
).8.
S.
Basu
, Cyber. Sys.
6
(2
), 107
–124
(2005
).9.
Z.
Pawlak
, Fuzzy Sets and Systems
, 17
(1
) 99
–102
(1985
).10.
E. T.
Lee
and L. A.
Zadeh
, Info. Scs.
, 1
(4
), 421
–434
(1969
).11.
S.
Sharan
and S. P.
Tiwari
, Products of Mealy-type rough finite state Machines
, in Proc. NCCCS, IEEE Explore
(2012
), pp. 1
–5
.12.
S.
Sharan
and S. P.
Tiwari
, Study of rough automata and fuzzy automata
, PhD thesis (Indian School of Mines Dhanbad
, 2012
).13.
K.
Tyagi
and A.
Tripathi
, Int. J. Fuzzy Sys. App.
6
(1
) 36
–55
(2017
).14.
H.J.
Zimmermann
, Fuzzy Set Theory and Its Applications
(Kluwer Academic Publishing.
, 1996
)
This content is only available via PDF.
© 2019 Author(s).
2019
Author(s)
You do not currently have access to this content.
