Afr. Mat.

DOI 10.1007/s13370-016-0416-1

Interval neutrosophic finite switchboard state machine

Tahir Mahmood1 Qaisar Khan1

Received: 28 April 2015 / Accepted: 4 March 2016

African Mathematical Union and Springer-Verlag Berlin Heidelberg 2016

Abstract In this paper we introduced the concept of interval neutrosophic finite state
machine, interval neutrosophic finite switchboard state machine using the notion of interval
neutrosophic set. We also introduced the concept of homomorphism and strong homomorphism of interval neutrosophic finite state machine.
Keywords Interval neutrosophic set Interval neutrosophic finite state machine Interval
neutrosophic finite switchboard state machine
Mathematics Subject Classification

03D05 20M35 68Q70 18B20 68Q45

1 Introduction
The theory of fuzzy sets was introduced by Zadeh in 1965 [17] as a genralization of crisp
sets. After the introduction of fuzzy sets many researcher applied the concept of fuzzy sets
in various fields and achieved a great success. After that Zadeh made an extension of fuzzy
sets and named this extension interval valued fuzzy set [18]. After these two extensions
Attanasov introduced the concept of intutionistic fuzzy sets in 1986 [1]. That is representing
objects by a membership and non membership fucntions. There were also other geralizations
of fuzzy sets such as bipolar valued fuzzy set [8], vague sets [3], cubic sets [6], interval
valued intutionistic fuzzy sets [2]. These were mathematical tools to discribe the uncertainity. Florentin Smarandache [12,13] introduced the concept of neutrosophy and neutrosophic
sets which was the genralization of fuzzy sets, intuitionistic fuzzy sets, interval valued fuzzy set
and all defined extensions, defined above. The word neutrosophy etymologically,

Qaisar Khan
qaisarkhan421@gmail.com
Tahir Mahmood
tahirbakhat@yahoo.com

Department of Mathematics and Statistics, International Islamic University, Islamabad, Pakistan

123

T. Mahmood, Q. Khan

neutro-sophy (noun) comes from French neutre Latin neuter, neutral, and Greek sophia,
skill/wisdom means knowledge of neutral thought. Neutrosophy is a branch of philospy introduced by which studies the origin and scope of neutralities, as well as thier interaction with
ideational spectra. This theory considers every notion or idea A together with its opposite
or negation antiA and with their spectrum of neutralities neutA in between them (i.e.
notions or ideas supporting neither A nor antiA). The neutA and antiA ideas together
are referred to as nonA. Neutrosophy is a generalization of Hegels dialectics (the last
one is based on A and antiA only). While a neutrosophic (adjective), means having
the nature of, or having the characteristic of Neutrosophy. A.neutrosophic set A is charaterized by a truth membership function T A , Indeterminancy membership function I A, Falsity
membership function FA . Where T A, I A and FA are real standard and nonstandard subsets
of ] 0, 1+ [. The neutrosophic sets is suitable for real life prolem, but it is difficult to apply
in scientific problems. The difference between neutrosophic sets and intuitionistic fuzzy sets
is that in neutrosophic sets the degree of indeterminancy is defined independently. To apply
neutrosophic set in real life and in scientific problems Wang et al. defined single valued
neutrosophic set and their set theoretic operators in 2011 [16]. In single valued neutrosophic
set closed interval [0, 1] can be taken instead of ] 0, 1+ [. In 2005 Wang et al. definend interval neutrosophic set and thier set theoretic properties , convexcity, truth-favorite and falsity
favorite interval neutrosophic set [15]. Malik et al. introduced the concept of submachine
of fuzzy finite state machin, product of fuzzy finite state machine [10,11]. Malik et al. also
introduced subsystem of fuzzy finite state machine [9]. In 2002 Kumbhojkar and Chaudhari
introduced covering of fuzzy finite state machine [7]. Sato and Kuroki introduced fuzzy finite
switchboard state machine in 2002 [14]. After the introduction of fuzzy finite state machine
Jun in 2005 introduced the concept of intuitionistic fuzzy finite state state machine, intutionistic submachine and their related propertis were discussed [4]. In 2006 Jun introduced the
concept of intuitionistic fuzzy finite switchboard state machine, commutative intuitionistic
fuzzy finite state machine and strong homomorphism [5]. In this paper we introduced the
concept of interval neutrosophic finite state machine, interval neutrosophic finite switchboard state machine using the notion of interval neutrosophic set. We also introduced the
concept of homomorphism and strong homomorphism of interval neutrosophic finite state
machine.

2 Preliminaries
In this section we define some basic definitions about intuitionistic fuzzy set, interval neutrosophic set and intuitionistic fuzzy finite state machine, intuitionistic fuzzy finite switchboard
state machine defined in [1,4,5,15].
Definition 2.1 [1] An intutionistic fuzzy set on the universal set X is an object of the form
H = {a, H (a), H (a)|a X }
where H : X [0, 1] and H : X [0, 1] are called the membership and non-membership
functions respectively and the conditon that 0 H (a) + H (a) 1 for all a X.
Definition 2.2 [4] A triple M = (N , U, H ) is called intuitionistic fuzzy finite state machine.
In which N , U, H are respectively, representing the set of states, the set of input symbols
and intuitionistic fuzzy sets in N U N .

123

Interval neutrosophic finite switchboard state machine

Definition 2.3 [5] An intuitionistic fuzzy finite state machine M = (N , U, H ) is said to be

switching if it satisfies:
H (r, a, s) = H (s, a, r ) and H (r, a, s) = H (s, a, r )
for all r, s, N and a U .
An intutionistic fuzzy finite state machine M = (N , U, H ) is said to be commutative if it
satisfies:
H (r, ab, s) = H (r, ba, s) and H (r, ab, s) = H (r, ba, s)
for all r, s, N and a, b U.
An intutionistic fuzzy finite state machine M = (N , U, H ) which is both switching and
commutative is called an intutionistic fuzzy finite switchboard state machine.
Definition 2.4 [15] Let X be a universal set. An interval neutrosophic set (I N S for short)
is of the form
S = { S (a), S (a), S (a)|a X }
= {a, [inf S (a), sup S (a)], [inf S (a), sup S (a)], [inf S (a), sup S (a)]|a X }.
where S (a), S (a) and S (a) respectively representing the truth-membership,
indeterminancy-memebership and falsity membership functions for each a X, S (a),
S (a), S (a) [0, 1] and the condition that 0 sup S (a) + sup S (a) + sup S (a) 3.
Definition 2.5 [15] An INS S set is empty if inf S (a) = sup S (a) = 0, inf S (a) =
sup S (a) = 1, inf S (a) = sup S (a) = 1 for all a X.
Definition 2.6 [15] Let A and B be two INSs. Then A is contained in B if and only
if inf A (a) inf B (a), sup A (a) sup B (a), inf A (a) inf B (a), sup A (a)
sup B (a), inf A (a) inf B (a), sup A (a) sup B (a).

3 Interval neutrosophic finite state machine

Definition 3.1 A triple M = (N , U, S) is called interval neutrosophic finite state machine
(I N F S M for short), where N , U are finite non-empty sets, called the set of states and input
symbols respectively, and S =  S (a), S (a), S (a) is an INS in N U N .
The set of all words of finite length of U is denoted by U . The empty word is denoted
by , and the length of each a U is denoted by |a|.
Definition 3.2 Let M = (N , U, S) be an INFSM. Define an INS S =  S (a), S (a),
S (a) in N U N by

[1, 1] if r = s
S (r, , s) :=
[0, 0] if r
= s

[0, 0] if r = s

S (r, , s) :=
[1, 1] if r
= s

123

T. Mahmood, Q. Khan

and


S (r, , s) :=

[0, 0]

if r = s

[1, 1]

if r
= s

S (r, ab, s) = vN [ S (r, a, v) S (v, b, s)],

S (r, ab, s) = vN [ S (r, a, v) S (v, b, s)]
and
S (r, ab, s) = vN [ S (r, a, v) S (v, b, s)]
for all r, s N , a U and b U.
Example 3.3 Let N = {r, s, v} and U = {a, b} and S be INS defined by
S (r, a, v) = [0.1, 0.2], S (r, a, v) = [0.4, 0.5], S (r, a, v) = [0.5, 0.6]
S (r, b, s) = [0.5, 0.7], S (r, b, s) = [0.2, 0.3], S (r, b, s) = [0.3, 0.4]
S (s, a, v) = [0.2, o.3], S (s, a, v) = [0.3, 0.4], S (s, a, v) = [0.6, 0.7]
S (v, a, v) = [0.3, 0.4], S (v, a, v) = [0.35, 0.4], S (v, a, v) = [0.4, 0.5]
S (v, b, s) = [0.8, 0.9], S (v, b, s) = [0, 0], S (v, b, s) = [0.1, 0.2].
Then (N , U, S) is an INFSM.
The transition daigram is given below:

Lemma 3.4 Let M = (N , U, S) be an INFSM. Then

S (r, ab, s) = vN [ S (r, a, v) S (v, b, s)]
S (r, ab, s) = vN [ S (r, a, v) S (v, b, s)]
and
S (r, ab, s) = vN [ S (r, a, v) S (v, b, s)]
for all r, s N and a, b U .

123

Interval neutrosophic finite switchboard state machine

Proof Let r, s N and a, b U . We prove the result by induction on |b| = k. If k = 0,

then b = , and so ab = a = a. Hence
vN [ S (r, a, v) S (v, b, s)] = vN [ S (r, a, v) S (v, , s)]
= S (r, a, s) = S (r, ab, s),
vN [ S (r, a, v) S (v, b, s)] = vN [ S (r, a, v) S (v, , s)]
= S (r, a, s) = S (r, ab, s)
and
vN [ S (r, a, v) S (v, b, s)] = vN [ S (r, a, v) S (v, , s)]
= S (r, a, s) = S (r, ab, s).
So the result is true for k = 0. Suppose that the result is true for |c| = k 1. That is for all
c U such that |c| = k 1, k > 0. Let b = cd, where c U and d U, and |c| = k 1.
Then
S (r, ab, s) = S (r, acd, s) = vN [ S (r, ac, v) S (v, d, s)]
= vN [wN [ S (r, a, w) S (w, c, v)] S (v, d, s)]
= vN [wN [ S (r, a, w) S (w, c, v)] S (v, d, s)]
= v,wN [ S (r, a, w) S (w, c, v) S (v, d, s)]
= wN [ S (r, a, w) (vN [ S (w, c, v) S (v, d, s))]
= wN [ S (r, a, w) S (w, cd, s)]
= wN [ S (r, a, w) S (w, b, s)],
(r, ab, s) = S (r, acd, s) = vN [ S (r, ac, v) S (v, d, s)]
S

= vN [wN [ S (r, a, w) S (w, c, v)] S (v, d, s)]

= v,wN [ S (r, a, w) S (w, c, v) S (v, d, s)]
= wN [ S (r, a, w) (vN [ S (w, c, v) S (v, d, s))]
= wN [ S (r, a, w) S (w, cd, s)]
= wN [ S (r, a, w) S (w, b, s)]
and
S (r, ab, s) = S (r, acd, s) = vN [ S (r, ac, v) S (v, d, s)]
= vN [wN [ S (r, a, w) S (w, c, v)] S (v, d, s)]
= v,wN [ S (r, a, w) S (w, c, v) S (v, d, s)]
= wN [ S (r, a, w) (vN [ S (w, c, v) S (v, d, s))]
= wN [ S (r, a, w) S (w, cd, s)]
= wN [ S (r, a, w) S (w, b, s)].
Therfore the result is true for |b| = n. This completes the proof.

4 Interval neutrosophic finite switchboard state machine

Definition 4.1 An INFSM M = (N , U, S) is said to be switching if it satisfies:
S (r, a, s) = S (s, a, r ), S (r, a, s) = S (s, a, r )

123

T. Mahmood, Q. Khan

and
S (r, a, s) = S (s, a, r )
for all r, s N and a U.
An INFSM M = (N , U, S) is said to be commutative if it satisfies:
S (r, ab, s) = S (r, ba, s), S (r, ab, s) = S (r, ba, s)
and
S (r, ab, s) = S (r, ba, s)
for all r, s N and a, b U.
If an INFSM M = (N , U, S) is both switching and commutative, then it is called interval
neutrosophic finite switchboard state machine (INFSSM for short).
Proposition 4.2 If M = (N , U, S) is a commutative INFSM, then
S (r, ba, s) = S (r, ab, s), S (r, ba, s) = S (r, ab, s)
and
S (r, ba, s) = S (r, ab, s).
for all r, s N and a U, b U .
Proof Let r, s N and a, b U . We prove the result by induction on |b| = k. If k = 0,
then b = , hence
S (r, ba, s) = S (r, a, s) = S (r, a, s) = S (r, a, s) = S (r, ab, s),
S (r, ba, s) = S (r, a, s) = S (r, a, s) = S (r, a, s) = S (r, ab, s)
and
S (r, ba, s) = S (r, a, s) = S (r, a, s) = S (r, a, s) = S (r, ab, s).
Therefore the result is true for k = 0. Suppose that the result is true for |c| = k 1. That is
for all c U with |c| = k 1, k > 0. Let d U be such that b = cd. Then
S (r, ba, s) = S (r, cda, s) = vN [ S (r, c, v) S (v, da, s)]
= vN [ S (r, c, v) S (v, ad, s)]
= S (r, cad, s)
= vN [ S (r, ca, v) S (v, d, s)]
= vN [ S (r, ac, v) S (v, d, s)]
= S (r, acd, s) = S (r, ab, s),
S (r, ba, s) = S (r, cda, s) = vN [ S (r, c, v) S (v, da, s)]
= vN [ S (r, c, v) S (v, ad, s)]
= S (r, cad, s)
= vN [ S (r, ca, v) S (v, d, s)]
= vN [ S (r, ac, v) S (v, d, s)]
= S (r, acd, s) = S (r, ab, s)

123

Interval neutrosophic finite switchboard state machine

and
S (r, ba, s) = S (r, cda, s) = vN [ S (r, c, v) S (v, da, s)]
= vN [ S (r, c, v) S (v, ad, s)]
= S (r, cad, s)
= vN [ S (r, ca, v) S (v, d, s)]
= vN [ S (r, ac, v) S (v, d, s)]
= S (r, acd, s) = S (r, ab, s).
Hence the result is true for |b| = k. Thus completes the proof.

Proposition 4.3 If M = (N , U, S) is an INFSSM, then

S (r, a, s) = S (s, a, r ), S (r, a, s) = S (s, a, r )
and
S (r, a, s) = S (s, a, r )
for all r, s N and a U .
Proof Let r, s N and a U . We prove the result by induction on |a| = k. If k = 0, then
b = , hence
S (r, a, s) = S (r, , s) = S (s, , r ) = S (s, a, r ),
S (r, a, s) = S (r, , s) = S (s, , r ) = S (s, a, r )
and
S (r, a, s) = S (r, , s) = S (s, , r ) = S (s, a, r ).
Therefore the result is true for k = 0. Assume that the result is true for |b| = k 1. That is
for all b U with |b| = k 1, k > 0, we have
S (r, b, s) = S (s, b, r ), S (r, b, s) = S (s, b, r )
and
S (r, b, s) = S (s, b, r ).
Let x U and b

be such that a = bx. Then

S (r, a, s) = S (r, bx, s) = vN [ S (r, b, v) S (v, x, s)]

= vN [ S (v, b, r ) S (s, x, r )]
= vN [ S (v, b, r ) S (s, x, r )]
= vN [ S (s, x, r ) S (r, b, v)]
= S (s, xb, r ) = S (s, bx, r ) = S (s, a, r ),
S (r, a, s) = S (r, bx, s) = vN [ S (r, b, v) S (v, x, s)]
= vN [ S (v, b, r ) S (s, x, r )]
= vN [ S (v, b, r ) S (s, x, r )]
= vN [ S (s, x, r ) S (r, b, v)]
= S (s, xb, r ) = S (s, bx, r ) = S (s, a, r )

123

T. Mahmood, Q. Khan

and
S (r, a, s) = S (r, bx, s) = vN [ S (r, b, v) S (v, x, s)]
= vN [ S (v, b, r ) S (s, x, r )]
= vN [ S (v, b, r ) S (s, x, r )]
= vN [ S (s, x, r ) S (r, b, v)]
= S (s, xb, r ) = S (s, bx, r ) = S (s, a, r ).
This shows that the result is true for |b| = k.

Proposition 4.4 If M = (N , U, S) is an INFSSM, then

S (r, ab, s) = S (r, ba, s), S (r, ab, s) = S (r, ba, s)
and
S (r, ab, s) = S (r, ba, s)
for all r, s N and a, b U .
Proof Let r, s N and a, b U . We prove the result by induction on |b| = k. If k = 0,
then b = , hence
S (r, ab, s) = S (r, a, s) = S (r, a, s) = S (r, a, s) = S (r, ba, s),
S (r, ab, s) = S (r, a, s) = S (r, a, s) = S (r, a, s) = S (r, ba, s)
and
S (r, ab, s) = S (r, a, s) = S (r, a, s) = S (r, a, s) = S (r, ba, s).
Therefore the result is true for k = 0. Suppose that the result is true for |c| = k 1. That is
for all c U with |c| = k 1, k > 0. Let d U be such that b = cd. Then
S (r, ab, s) = S (r, acd, s) = vN [ S (r, ac, v) S (v, d, s)]
= vN [ S (r, ca, v) S (v, d, s)]
= vN [ S (v, ca, r ) S (s, d, v)]
= vN [ S (s, d, v) S (v, ca, r )]
= S (s, dca, r ) = vN [ S (s, dc, v) S (v, a, r )]
= vN [ S (s, cd, v) S (v, a, r )] = S (s, cda, r )
= S (r, cda, s) = S (r, ba, s),
(r, ab, s) = S (r, acd, s) = vN [ S (r, ac, v) S (v, d, s)]
S

= vN [ S (r, ca, v) S (v, d, s)]

= vN [ S (v, ca, r ) S (s, d, v)]
= vN [ S (s, d, v) S (v, ca, r )]
= S (s, dca, r ) = vN [ S (s, dc, v) S (v, a, r )]
= vN [ S (s, cd, v) S (v, a, r )] = S (s, cda, r )
= S (r, cda, s) = S (r, ba, s)

123

Interval neutrosophic finite switchboard state machine

and
S (r, ab, s) = S (r, acd, s) = vN [ S (r, ac, v) S (v, d, s)]
= vN [ S (r, ca, v) S (v, d, s)]
= vN [ S (v, ca, r ) S (s, d, v)]
= vN [ S (s, d, v) S (v, ca, r )]
= S (s, dca, r ) = vN [ S (s, dc, v) S (v, a, r )]
= vN [ S (s, cd, v) S (v, a, r )] = S (s, cda, r )
= S (r, cda, s) = S (r, ba, s).
This shows that the result is true for |b| = k.

Definition 4.5 Let M S = (N1 , U1 , S) and MT = (N2 , U2 , T ) be two INFSMs. A pair

(, ) of mappings : N1 N2 and : U1 U2 is called homomorphism, written as
(, ) : M S MT ,if it satisfies:
S (r, a, s) T ((r ), (a), (s)), S (r, a, s) T ((r ), (a), (s))
and
S (r, a, s) T ((r ), (a), (s))
for all r, s N1 and a U1 .
Example 4.6 Let M S = (N1 , U1 , S) and MT = (N2 , U2 , T ) be two INFSMs. Where N1 =
{s1 , s2 , s3 }, U1 = {x, y}, N2 = {n 1 , n 2 } and U2 = {x, y}, S and T are defined below:
S (s1 , x, s1 ) = [0.1, 0.2], S (s1 , x, s1 ) = [0.6, 0.7], S (s1 , x, s1 ) = [0.8, 0.9],
S (s1 , x, s2 ) = [0.15, 0.25], S (s1 , x, s2 ) = [0.55, 0.65], S (s1 , x, s1 ) = [0.75, 0.85],
S (s1 , y, s2 ) = [0.2, 0.3], S (s1 , y, s2 ) = [0.5, 0.6], S (s1 , y, s2 ) = [0.7, 0.8],
S (s2 , x, s1 ) = [0.25, 0.35], S (s2 , x, s1 ) = [0.4, 0.5], S (s2 , x, s1 ) = [0.65, 0.75],
S (s2 , y, s3 ) = [0.3, 0.4], S (s2 , y, s3 ) = [0.35, 0.45], S (s2 , y, s3 ) = [0.6, 0.7],
S (s3 , x, s3 ) = [0.5, 0.6], S (s3 , x, s3 ) = [0.3, 0.35], S (s3 , x, s3 ) = [0.55, 0.65],
S (s3 , y, s2 ) = [0.35, 0.45], S (s3 , y, s2 ) = [0.3, 0.4], S (s3 , y, s2 ) = [0.5, 0.6].
The transition daigram is given below:

123

T. Mahmood, Q. Khan

Define a mappings : N1 N2 and : U1 U2 , by (s1 ) = (s2 ) = n 1 , (s3 ) =

n 2 , (x) = x and (y) = y.
The homomorphic image of M S
T (n 1 , x, n 1 ) = [0.5, 0.6], T (n 1 , x, n 1 ) = [0.3, 0.4], T (n 1 , x, n 1 ) = [0.5, 0.6],
T (n 1 , y, n 1 ) = [0.55, 0.65], T (n 1 , y, n 1 ) = [0.29, 0.39], T (n 1 , y, n 1 ) = [0.4, 0.45],
T (n 1 , y, n 2 ) = [0.6, 0.7], T (n 1 , y, n 2 ) = [0.21, 0.2], T (n 1 , y, n 2 ) = [0.35, 0.42],
T (n 2 , x, n 2 ) = [0.65, 0.75], T (n 2 , x, n 2 ) = [0.2, 0.25], T (n 2 , x, n 2 ) = [0.3, 0.35],
T (n 2 , x, n 1 ) = [0.7, 0.8], T (n 2 , x, n 1 ) = [0.15, 0.2], T (n 2 , x, n 1 ) = [0.25, 0.3],
T (n 2 , y, n 1 ) = [0.75, 0.85], T (n 2 , y, n 1 ) = [0.1, 0.15], T (n 2 , y, n 1 ) = [0.1, 0.2].
The

Definition 4.7 Let M S = (N1 , U1 , S) and MT = (N2 , U2 , T ) be two INFSMs. A pair (, )

of mappings : N1 N2 and : U1 U2 is called a strong homomorphism, written as
(, ) : M S MT , if it satisfies:
T ((r ), (a), (s)) = { S (r, a, v)|v N1 , (v) = (s)},
T ((r ), (a), (s)) = { S (r, a, v)|v N1 , (v) = (s)}
and
T ((r ), (a), (s)) = { S (r, a, v)|v N1 , (v) = (s)}
for all r, s N1 and a U1 . If U1 = U2 and is the identity map, then we simply write
: M S MT and say that is a homomorphism or strong homomorphism accordingly. If
(, ) is a strong homorphism with is one-one, then
T ((r ), (a), (s)) = S (r, a, s), T ((r ), (a), (s)) = S (r, a, s)
and
T ((r ), (a), (s)) = S (r, a, s)
for all r, s N1 and a U1 .
Theorem 4.8 Let M S = (N1 , U1 , S) and MT = (N2 , U2 , T ) be two INFSMs. Let
(, ) : M S MT be an onto strong homomorphism. If M S is a commutative, then so
is MT .

123

Interval neutrosophic finite switchboard state machine

Proof Let r2 , s2 N2 . Then there are r1 , s1 N1 such that (r1 ) = r2 and (s1 ) = s2 . Let
x2 , y2 U2 . Then there exists x1 , y1 U1 such that (x1 ) = x2 and (y1 ) = y2 . Since M S
is commutative, we have
T (r2 , x2 y2 , s2 ) = T ((r1 ), (x1 )(y1 ), (s1 ))
= T ((r1 ), (x1 , y1 ), (s1 ))
= { S (r1 , x1 y1 , v1 )|v1 N1 , (v1 ) = (s1 )}
= { S (r1 , y1 x1 , v1 )|v1 N1 , (v1 ) = (s1 )}
= T ((r1 ), (y1 x1 ), (s1 ))
= T (r2 , y2 x2 , s2 ),
T (r2 , x2 y2 , s2 ) = T ((r1 ), (x1 )(y1 ), (s1 ))
= T ((r1 ), (x1 , y1 ), (s1 ))
= { S (r1 , x1 y1 , v1 )|v1 N1 , (v1 ) = (s1 )}
= { S (r1 , y1 x1 , v1 )|v1 N1 , (v1 ) = (s1 )}
= T ((r1 ), (y1 x1 ), (s1 ))
= T ((r1 ), (y1 )(x1 ), (s1 ))
= T (r2 , y2 x2 , s2 )
and
T (r2 , x2 y2 , s2 ) = T ((r1 ), (x1 )(y1 ), (s1 ))
= T ((r1 ), (x1 , y1 ), (s1 ))
= { S (r1 , x1 y1 , v1 )|v1 N1 , (v1 ) = (s1 )}
= { S (r1 , y1 x1 , v1 )|v1 N1 , (v1 ) = (s1 )}
= T ((r1 ), (y1 x1 ), (s1 ))
= T ((r1 ), (y1 )(x1 ), (s1 ))
= T (r2 , y2 x2 , s2 ).
Hence MT is a commutative INFSM. This completes the proof.

Proposition 4.9 Let M S = (N1 , U1 , S) and MT = (N2 , U2 , T ) be two INFSMs. Let

(, ) : M S MT be a strong homomorphism. Then
(u, v N1 )(a U1 )(T ((u), (a), (v)) > [0, 0]
(w N1 )( S (u, a, v) > [0, 0], (w) = (v)),
(u, v N1 )(a U1 )(T ((u), (a), (v)) < [1, 1]
(w N1 )( S (u, a, v) < [1, 1], (w) = (v)),
and
(u, v N1 )(a U1 )(T ((u), (a), (v)) < [1, 1]
(w N1 )( S (u, a, v) < [1, 1], (w) = (v)).
Moreover,
(z N1 )((z) = (u) S (u, a, w)
S (z, a, r ), S (u, a, w) S (z, a, r ) and S (u, a, w) S (z, a, r ).

123

T. Mahmood, Q. Khan

Proof Let u, v, z N1 and a U1 . Assume that T ((u), (a), (v)) > [0, 0],
(T ((u), (a), (v)) < [1, 1] and (T ((u), (a), (v)) < [1, 1]. Then
{ S (u, a, v1 )|v1 N1 , (v1 ) = (v)} > [0, 0],
{ S (u, a, v1 )|v1 N1 , (v1 ) = (v)} < [1, 1]
and
{ S (u, a, v1 )|v1 N1 , (v1 ) = (v)} < [1, 1].
Since N1 is finite, it follows that there exists w N1 such that (w) = (v),
S (u, a, w) = { S (u, a, v1 )|v1 N1 , (v1 ) = (w)} > [0, 0],
S (u, a, v) = { S (u, a, v1 )|v1 N1 , (v1 ) = (w)} < [1, 1]
and
S (u, a, v) = { S (u, a, v1 )|v1 N1 , (v1 ) = (w)} < [1, 1].
Now suppose that (z) = (u) for every z N1 . Then
S (u, a, w) = T ((u), (a), (v)) = T ((z), (a), (v))
= { S (z, a, v1 )|v1 N1 , (v1 ) = (v)} S (z, a, v),
S (u, a, w) = T ((u), (a), (v)) = T ((z), (a), (v))
= { S (z, a, v1 )|v1 N1 , (v1 ) = (v)} S (z, a, v)
and
S (u, a, w) = T ((u), (a), (v)) = T ((z), (a), (v))
= { S (z, a, v1 )|v1 N1 , (v1 ) = (v)} S (z, a, v)


which is the required proof.

Lemma 4.10 Let M S = (N1 , U1 , S) and MT = (N2 , U2 , T ) be two INFSMs. Let

(, ) : M S MT be a homomorphism. Define a mapping : U1 U2 by ( ) =
and (x y) = (x) (y) for all x U1 and y U1 . Then (ab) = (a) (b) for
all a, b U1 .
Proof Let a, b U1 . We prove the result by induction on |b| = k. If k = 0, then b = .
Therefore ab = a = a. Hence
(ab) = (a) = (a) = (a) ( ) = (a) (b)
which shows that the result is true for k = 0. Let us assume that the result is true for each
c U1 such that |c| = k 1. That is
(ab) = (a) (b).
Let b = cd, where c U1 and d U1 be such that |c| = k 1, k > 0. Then
(ab) = (acd) = (ac)(d) = (a) (c)(d) = (a) (cd) = (a) (b).
Therefore the result is true for |b| = k.

123

Interval neutrosophic finite switchboard state machine

Theorem 4.11 Let M S = (N1 , U1 , S) and MT = (N2 , U2 , T ) be two INFSMs. Let

(, ) : M S MT be a homomorphism. Then
S (r, a, s) T ((r ), (a), (s)), S (r, a, s) T ((r ), (a), (s))
and
S (r, a, s) T ((r ), (a), (s))
for all r, s N1 and a U1 .
Proof Let r, s N1 and a U1 . We prove the result by induction on |a| = k. If k = 0, then
a = and so (a) = ( ) = . If r = s, then
S (r, a, s) = S (r, , s) = [1, 1] = T ((r ), , (s)) = T ((r ), (a), (s)),
S (r, a, s) = S (r, , s) = [0, 0] = T ((r ), , (s)) = T ((r ), (a), (s))
and
S (r, a, s) = S (r, , s) = [0, 0] = T ((r ), , (s)) = T ((r ), (a), (s)).
If r
= s, then
S (r, a, s) = S (r, , s) = [0, 0] T ((r ), (a), (s)),
S (r, a, s) = S (r, , s) = [1, 1] T ((r ), (a), (s))
and
S (r, a, s) = S (r, , s) = [1, 1] T ((r ), (a), (s)).
Therefore the result is true for k = 0. Let us assume that the result is true for all b U1 such
that |b| = k 1, k > 0. Let a = bc,where b U1 , c U1 and |b| = k 1. Then
S (r, a, s) = S (r, bc, s) = vN1 [ S (r, b, v) S (v, c, s)]

vN1 [T ((r ), (b), (v)) T ((v), (c), (s))]

v N1 [T ((r ), (b), v ) T (v , (c), (s))]

= T ((r ), (b)(c), (s))

= T ((r ), (bc), (s))
= T ((r ), (a), (s)),

S (r, a, s) = S (r, bc, s) = vN1 [ S (r, b, v) S (v, c, s)]

vN1 [T ((r ), (b), (v)) T ((v), (c), (s))]

v N1 [T ((r ), (b), v ) T (v , (c), (s))]

= T ((r ), (b)(c), (s))

= T ((r ), (bc), (s))
= T ((r ), (a), (s))

123

T. Mahmood, Q. Khan

and
S (r, a, s) = S (r, bc, s) = vN1 [ S (r, b, v) S (v, c, s)]

vN1 [T ((r ), (b), (v)) T ((v), (c), (s))]

v N1 [T ((r ), (b), v ) T (v , (c), (s))]

= T ((r ), (b)(c), (s))

= T ((r ), (bc), (s))
= T ((r ), (a), (s))

which is the required proof.

Theorem 4.12 Let M S = (N1 , U1 , S) and MT = (N2 , U2 , T ) be two INFSMs. Let

(, ) : M S MT be a strong homomorphism. If is one-one, then
S (r, a, s) = T ((r ), (a), (s)), S (r, a, s) = T ((r ), (a), (s))
and
S (r, a, s) = T ((r ), (a), (s))
for all r, s N1 and a U1 .
Proof Let us assume that is 11 and for r, s N1 and a U1 . Let |a| = k. We prove the
result by induction on on |a| = k. If k = 0, then a = and ( ) = . Since (r ) = (s)
if and only if r = s, we get
S (r, a, s) = S (r, , s) = [1, 1]
if and only if
T ((r ), (a), (s)) = T ((r ), ( ), (s)) = [1, 1],
S (r, a, s) = S (r, , s) = [0, 0]
if and only if
T ((r ), (a), (s)) = T ((r ), ( ), (s)) = [0, 0],
and
S (r, a, s) = S (r, , s) = [0, 0]
if and only if
T ((r ), (a), (s)) = T ((r ), ( ), (s)) = [0, 0].

123

Interval neutrosophic finite switchboard state machine

Let us assume that the result is true for all b U1 such that |b| = k 1, k > 0. Let a = bc,
where |b| = k 1, k > 0 and b U1 , c U1 . Then
T ((r ), (a), (s)) = T ((r ), (bc), (s)) = T ((r ), (b)(c), (s))
= vN1 [T ((r ), (b), (v)) T ((v), (c), (s))]
= vN1 [ S (r, b, v) S (v, c, s)]
= S (r, bc, s) = S (r, a, s),

T ((r ), (a), (s)) = T ((r ), (bc), (s)) = T ((r ), (b)(c), (s))

= vN1 [T ((r ), (b), (v)) T ((v), (c), (s))]
= vN1 [ S (r, b, v) S (v, c, s)]
= S (r, bc, s) = S (r, a, s)
and
T ((r ), (a), (s)) = T ((r ), (bc), (s)) = T ((r ), (b)(c), (s))
= vN1 [T ((r ), (b), (v)) T ((v), (c), (s))]
= vN1 [ S (r, b, v) S (v, c, s)]
= S (r, bc, s) = S (r, a, s)
which is the required proof.

Conclusion
Using interval neutrosophic set we introduced the concept of interval neutrosophic finite state
machine which is extension of fuzzy finite state machine and intuitionistic fuzzy finite state
machine and discussed some related results. We also introduce the concept of interval neutrosophic switchboard state machine, homomorphism and storng homomorphism in interval
neutrosophic finite state machine and discussed some related resuls. In future we work on
interval neutrosophic automata.

References
1. Atanassov, K.T.: Intuitionistic fuzzy sets. Fuzzy Sets Syst. 20(1), 8796 (1986)
2. Atanassov, K., Gargov, G.: Interval valued intuitionistic fuzzy sets. Fuzzy Sets Syst. 31(3), 343349
(1989)
3. Gau, W.L., Buehrer, D.J.: Vague sets. IEEE Trans. Syst. Man Cybern. 23(2), 610614 (1993)
4. Jun, Y.B.: Intuitionistic fuzzy finite state machines. J. Appl. Math. Comput. 17(12), 109120 (2005)
5. Jun, Y.B.: Intuitionistic fuzzy finite switchboard state machines. J. Appl. Math. Comput. 20(12), 315325
(2006)
6. Jun, Y.B., Kim, C.S., Yang, K.O.: Cubic sets. Ann. Fuzzy Math. Inform. 4(1), 8398 (2012)
7. Kumbhojkar, H.V., Chaudhari, S.R.: On covering of products of fuzzy finite state machines. Fuzzy Sets
Syst. 125(2), 215222 (2002)
8. Lee, K. M.: Bipolar-valued fuzzy sets and their operations. In: Proc. Int. Conf. on Intelligent Technologies,
Bangkok, Thailand, pp. 307312 (2000)
9. Malik, D.S., Mordeson, J.N., Sen, M.K.: On subsystems of a fuzzy finite state machine. Fuzzy Sets Syst.
68(1), 8392 (1994)
10. Malik, D.S., Mordeson, J.N., Sen, M.K.: Submachines of fuzzy finite state machines. J. Fuzzy Math. 2(4),
781792 (1994)
11. Malik, D.S., Mordeson, J.N., Sen, M.K.: Products of fuzzy finite state machines. Fuzzy Sets Syst. 92(1),
95102 (1997)
12. Smarandache, F.: Neutrosophic Probability, Set, and Logic, p. 105. Am. Res. Press, Rehoboth (1998)

123

T. Mahmood, Q. Khan
13. Smarandache, F.: A Unifying Field in Logics. Neutrosophy: Neutrosophic Probability, Set and Logic, pp.
1141. American Research Press, Rehobothm, MA (1999)
14. Sato, Y., Kuroki, N.: Fuzzy finite switchboard state machines. J. Fuzzy Math. 10(4), 863874 (2002)
15. Wang, H., Smarandache, F., Zhang, Y.Q., Sunderraman, R.: Interval Neutrosophic Sets and Logic: Theory
and Applications in Computing, vol. 5. Hexis, Phoenix, AZ (2005)
16. Wang, H., Smarandache, F., Zhang, Y.Q., Sunderraman, R.: Single valued neutrosophic sets. Multispace
Multistruct 4, 410413 (2010)
17. Zadeh, L.A.: Information and control. Fuzzy Sets 8(3), 338353 (1965)
18. Zadeh, L.A.: The Concept of a Linguistic Variable and its Application to Approximate Reasoning.
Springer, US (1974)

123