Journal article Open Access

Neutrosophic General Finite Automata

J. Kavikumar; D. Nagarajan; et al

The constructions of finite switchboard state automata is known to be an extension of finite automata in the
view of commutative and switching automata. In this research, the idea of a neutrosophic is incorporated in the general
fuzzy finite automata and general fuzzy finite switchboard automata to introduce neutrosophic general finite automata
and neutrosophic general finite switchboard automata. Moreover, we define the notion of the neutrosophic subsystem
and strong neutrosophic subsystem for both structures. We also establish the relationship between the neutrosophic
subsystem and neutrosophic strong subsystem.

Files (582.8 kB)
Name Size
Neutrosophic General Finite Automata.pdf
md5:5bbff3610ef862e8f291d45d53954a8c
582.8 kB Download
60
22
views
downloads
All versions This version
Views 6062
Downloads 2222
Data volume 12.8 MB12.8 MB
Unique views 5557
Unique downloads 2121

Share

Cite as