IOSR Journal of Mathematics (IOSR-JM)

e-ISSN: 2278-5728, p-ISSN: 2319-765X. Volume 10, Issue 6 Ver. V (Nov - Dec. 2014), PP 51-57
www.iosrjournals.org

An Intuitionistic Fuzzy Finite Automaton on Homomorphism and

Admissible relation
Jency Priya .K1*, Telesphor Lakra2, Jeny Jordon.A3, Rajaretnam.T4
1,2,3,4

(Department of Mathematics, St. Josephs College (Autonomous), Tiruchirappalli, TN, India)

Abstract: An intuitionistic fuzzy finite automaton with an unique membership transition on an input symbol
IFA-UM is considered. IFA-UM homomorphism and strong homomorphism are defined. Admissible relation on
the set of states of an IFA-UM is characterized. Each admissible relation on an IFA-UM, finds an IFA-UM
1 and there is a strong homomorphism from to 1 .
Keywords: Intuitionistic fuzzy finite automaton IFA-UM, Intuitionistic fuzzy behavior, Homomorphism,
Strong homomorphism and Admissible relation.

I.

Introduction

The concept of ``Fuzzy Sets'' [12] was introduced to describe vagueness mathematically in its abstract
form by giving a grade of membership to each member of a given set. L.A. Zadeh thus laid the foundations of
fuzzy set theory in 1965. He considers the ``membership'' in a fuzzy set not as a matter of affirmation or denial,
rather one of degree. Over the last five decades, his proposal has gained important recognition in the theory of
formal languages. Automata theory is closely related to formal language theory since the automata are often
defined by the class of formal languages they are able to recognize. A finite automaton gives a finite
representation of a regular language that may be an infinite set. To deal with any imprecision or uncertainty
arising out of the fuzziness in modeling some systems, fuzzy automata and fuzzy languages have been
introduced [6]. In fuzzy automata, a set of strings recognized is said to be a fuzzy language. In a fuzzy finite
state automaton, there may be more than one fuzzy transition from a state on an input symbol with a given
membership value as assigned by Santos, Wee and Fu [10,11]. This development was followed by the
postulation that there can be at most one transition on an input, which can be constructed equivalently from a
fuzzy finite state automaton. This postulation led to the description of deterministic fuzzy finite state automaton
by Malik and Mordeson [7]. However, the deterministic fuzzy finite state automaton only acts as a deterministic
fuzzy recognizer, whereas the fuzzy regular languages accepted by the fuzzy finite state automaton and
deterministic fuzzy finite state automaton need not necessarily be equal (i.e. the degree of a string need not be
the same). It is introduced [8] as fuzzy finite state automaton with unique membership transition (uffsa) in
which the membership values of any recognized string in both the systems are the same.
The concept intuitionistic fuzzy sets (IFS) introduced by Atanassov [1-3] has been found to be highly
useful to deal with vagueness, since the IFS is characterized by two functions expressing the degree of
belongingness and the degree of non-belongingness. Burillo and Bustince [4] proved that the notion of vague
sets coincides with that of intuitionistic fuzzy sets. This idea is a natural generalization of a standard fuzzy set,
and seems to be useful in modeling many real life situations and it is easier describing negative factors than the
positive attributes. It is possible to obtain intuitionistic fuzzy language by introducing membership and nonmembership value to the strings of fuzzy language. Jun [5] introduced the intuitionistic fuzzy finite state
machines. For any intuitionistic fuzzy finite automaton (IFA) there is an equivalent intuitionistic fuzzy finite
automaton with unique membership (IFA-UM) transition on an input symbol [9]. The IFA-UM produces the
same membership values for the recognized strings.
In this paper, the behaviors of a homomorphism of an IFA-UM of both membership and nonmembership are discussed. If there is a strong homomorphism and the function is bijective then their
behaviors hold equality. The concept of admissible relation of IFA-UM is introduced and for every IFA-UM,
there is a 1 such that there exists a strong homomorphism between and 1 respectively.

II.

Basic definitions

Definition 2.1 Given a nonempty set . Intuitionistic fuzzy sets ( IFS) in is an object having the form
A {(x, A (x), A (x)) | x } , where A : [0,1] and A : [0,1] denote the degree of membership and
the degree of non-membership of each element x to the set A respectively, and 0 A (x) A (x) 1 for
each x . For the sake of simplicity, use the notation A ( A , A ) instead of A {(x, A (x), A (x)) | x } .
Definition 2.2 Intuitionistic fuzzy finite automaton with unique membership transition on an input symbol(IFAUM) is an ordered 5-tuple = (Q, , A, i, f) where Q is a finite non-empty set of states, is a finite non-empty
www.iosrjournals.org

51 | Page

An Intuitionistic Fuzzy Finite Automaton on Homomorphism and Admissible relation

set of input symbols, A ( A , A ) is an intuitionistic fuzzy subset of Q Q , where A and A denotes the
degree of membership and non-membership values respectively such that A (p,a,q) A (p,a,q') for some

q, q ' Q then q q ', i (i A ,i A ) and f (f A ,f A ) are called the intuitionistic fuzzy subset of initial state and
final states respectively, from Q [0,1] .
Definition 2.3 Let = (Q, , A, i, f) be an IFA-UM. Define an IFS A ( A , A ) in Q Q as follows:
p, q Q, x , a ,

1,
0,

A (q,, p)

if p q
if p q

0,
1,

A (q,, p)

and

A (q, xa, p) A (q, x, r) A (r,a, p) | r Q ,

if p q
,
if p q

A (q, xa, p) A (q, x, r) A (r,a, p) | r Q .

Definition 2.4
Definition 2.5
L x =
L x =

The intuitionistic fuzzy behavior of IFA-UM is L = (L , L )

A string x is recognized by if
i A p A p, x, q f A q p, q Q > 0 and
i A p A p, x, q f A q p, q Q < 1

III.

Homomorphism

Definition 3.1 Let and be two IFA-UMs. A pair , of mappings : QA QB and

: is called a homomorphism, written , : , if p, q QA and a
(i)
A (p, a, q) B p , a , (q) and A (p, a, q) B p , a , (q) .
(ii)
x QA , i A (p) i B ((p)) and x QA , i A (p) i B ((p))
(iii)
x QA , f A (p) f B ((p)) and x QA , f A (p) f B ((p))
The pair , is called a strong homomorphism if p, q QA and a ,
(a)
B p , a , (q) = {A (p, a, t)|t QA , t = (q)} and
B p , a , (q) = {A (p, a, t)|t QA , t = (q)}
Further, if p = q then
(a)
B p , a , (q) = {A (s, a, t)| t = q , s = (p)} and
B p , a , (q) = {A (p, a, t)| t = q , s = (p)}
(iv)
i B p = {i A (t)|t QA , t = p } and i B p = {i A (t)|t QA , t = p }
(v)
f B p = {f A (t)|t QA , t = p } and f B p = {f A (t)|t QA , t = p }
A homomorphism (strong homomorphism) , : is an isomorphism (strong isomorphism), if and
are both one-one and onto.
Definition 3.2 If , is a strong homomorphism with one-one, then p, q QA and a ,
B p , a , (q) = A (p, a, q) and B p , a , (q) = A p, a, q . If = and is the identity map,
then we write : and say that is a homomorphism or strong homomorphism accordingly.
Example 3.3 Let QA = q1 , q2 , q3 , = {a, b} with A : QA QA [0,1] and A : QA QA [0,1]. Let
QB = q1 , q2 , q3 , = {a, b} with B : QB QB [0,1] and B : QB QB [0,1]. The intuitionistic fuzzy
initial states with membership values are i A q1 = 0.8, i B q1 = 0.8 and non-membership values are
i A q1 = 0.2, i B q1 = 0.2. The intuitionistic fuzzy final states with membership values are f A q3 =
0.7, f B q3 = 0.7 and non-membership values are f A q1 = 0.3, f B q3 = 0.3. The intuitionistic fuzzy
transitions are given as follows:
A (q1 ,a,q1 ) 0.3, A (q1 , b,q 2 ) 0.6, A (q 2 ,a,q1 ) 0.3,
A (q 2, b,q3 ) 0.6, A (q3, b,q 2 ) 0.5, A (q3 ,a,q3 ) 0.2

A (q1 ,a,q1 ) 0.4, A (q1 , b,q 2 ) 0.4, A (q 2 ,a,q1 ) 0.5 ,

A (q2 , b,q3 ) 0.2, A (q3 , b,q 2 ) 0.4, A (q3 ,a,q3 ) 0.6
and B (q'1 ,a,q'1 ) 0.3, B (q'1 , b,q'2 ) 0.6, B (q'2 ,a,q'1 ) 0.3, B (q'3 , b,q'2 ) 0.5, B (q'3 ,a,q'1 ) 0.5,
B (q'1 ,a,q'1 ) 0.4, B (q'1 , b,q'2 ) 0.4, B (q'2 ,a,q'1 ) 0.5, B (q'3 , b,q'2 ) 0.4, B (q'3 ,a,q'1 ) 0.5
Let : QA QB by (q1 ) q1' , (q2 ) q2' , (q3 ) q3' and : by (a) a, (b) b .
Clearly, ( , ) is a strong homomorphism from into . Since and are bijective, ( , ) is an
isomorphism of IFA-UM.

www.iosrjournals.org

52 | Page

An Intuitionistic Fuzzy Finite Automaton on Homomorphism and Admissible relation

Lemma 3.4 Let and be two IFA-UMs and ( , ) be a strong homomorphism, for all q, r QA , a

B (q), (a), (r) 0

if

and

B (q), (a), (r) 1 ,

then

there

A (q,a, t) 0, A (q,a, t) 1 and (t) (r) . Furthermore, for all

A (q,a, t) A (p,a, r) and A (q,a, t) A (p,a, r) .

exists

p QA

if

t QA

such

that

(p) (q) , then

Proof: Let p, q, r QA , a , then B (q), (a), (r) 0 and B (q), (a), (r) 1 .
But B (q), (a), (r) { A (q,a, t) | (t) (r)} , B (q), (a), (r) { A (q,a, t) | (t) (r)} .
Since QA is a finite, there exists t QA and r QB such that (t) (r)
and B (q), (a), (r) A (q,a, t) 0 .

Suppose (p) (q) , then A (q,a, t) B (q), (a), (r) B (p), (a), (r) A (p,a, r)
and A (q,a, t) B (q), (a), (r) B (p), (a), (r) A (p,a, r) .
Lemma 3.5 If the mapping : is extended as : by
1. ( ) ( )
2. (a1a 2 ....a n ) (a1 ) (a 2 ).... (a n ), n 0,a1 , a2 ..., an .
Then (xy) (x) (y), x, y .
Lemma 3.6 If ( , ) is a homomorphism. Then x , p, q QA ,

1. A (p, x,q) B (p), (x), (q) and A (p, x,q) B (p), (x), (q)
2. iA (p) iB ( (p)) and i A (p) i B ( (p)), p Q A
3. f A (p) f B ( (p)) and f A (p) f B ( (p)), p Q A
Proof: We prove (1) by induction on | x | n for x . The result is trivial for n 0 .
Assume that the result is true for all x such that | x | n 1,n 0 .
Let | x | n, x ya where y , a and | y | n 1 .

A (p, x, q)

A (p, ya,q)
{ A (p, y, r) A (r,a,q) | r Q A}

B (p), (y), (r) B (r), (a), (q) | r QA

B (p), (y), r ' B r', (a), (q) | r ' QB

(p), (ya), (q)

(p), (x), (q)

B (p), (y) (a), (q)

B
B

and

A (p, x, q)

A (p, ya,q)
{ A (p, y, r) A (r,a,q) | r Q A }

B (p), (y), (r) B (r), (a), (q) | r QA

B (p), (y), r ' B r', (a), (q) | r ' QB

(p), (ya), (q)

(p), (x), (q)

B (p), (y) (a), (q)

B

Thus the result is true for | x | n , hence 1, 2 and 3 follows from the definition.
Theorem 3.7 Let and be two IFA-UMs with L and L be the intuitionistic fuzzy behavior of and
respectively. Let , : be a homomorphism. Then for all x ,
L (x) L ( (x)) and L (x) L ( (x)).
www.iosrjournals.org

53 | Page

An Intuitionistic Fuzzy Finite Automaton on Homomorphism and Admissible relation

Proof: Let x ,

(x) {i

(q) | q Q }| p Q .

Now, L (x) {i A (p) A (p, x,q) f A (q) | q Q A }| p QA

and L

(p) A (p, x,q) f A

Since QA is finite, there exists r , s QA such that

L (x) i A (r) A (r, x,s) f A (s)

r ', (x),s' f (s') | s' Q | r ' Q

iB (r) B (r), (x), (s) f B (s)

iB (r') B

L ( (x))

and
L (x) i A (r) A (r, x,s) f A (s)

(r') r ', (x),s' f (s') | s' Q | r ' Q

i B (r) B (r), (x), (s) f B (s)

i B

L ( (x)).

Therefore, L (x) L ( (x)) and L (x) L ( (x)), x .

Corollary 3.7.1 If is the identity map then L L .
Lemma 3.8 If ( , ) is a strong homomorphism and is bijective then p, q QA , x .

(i)

A (p, x,q) B (p), (x), (q) and A (p, x, q) B (p), (x), (q) ,

(ii)

i A (p) iB (p) and i A (p) i B (p) ,

(iii)

f A (p) f B (p) and f A (p) f B (p) .

Proof: Suppose is one-one and onto.

Let p, q QA , x . By induction on | x | n . The result is trivial for n 0 .
Suppose the result is true for x ,| x | n 1 .
1.
Then

Let | x | n, x ya where y , a and | y | n 1 .

B (p), (x), (q)

(p), (y) (a), (q)

(p), (y), r' r', (a), (q) | r ' Q

B (p), (ya), (q)

and

B (p), (x), (q)

(p), (y) (a), (q)

(p), (y), r' r', (a), (q) | r ' Q

B (p), (ya), (q)

Since is onto, for r ' QB , there exists an r QA such that (r) r' .
Therefore,

B (p), (x), (q)

B (p), (y), (r) B (r), (a), (q) | r QA

A (p, y, r) A (r,a,q) | r Q A by induction

(p, ya,q)

A (p, x,q)

and
www.iosrjournals.org

54 | Page

An Intuitionistic Fuzzy Finite Automaton on Homomorphism and Admissible relation

p, y, r

B (p), (x), (q)

B (p), (y), (r) B (r), (a), (q) | r QA

r, a, q | r Q
A

by induction

A (p, ya,q)
A (p, x,q)

2.

Let p QA , iB (p) i A (r) | r Q A , (r) (p) and

i B (p) i A (r) | r Q A , (r) (p)

Since is one-one, iB (p) i A (p) and i B (p) i A (p) .

3.

Let p QA ,f B (p) f A (r) | r Q A , (r) (p)

f B (p) f A (r) | r Q A , (r) (p)

Since is one-one, f B (p) f A (p) and f B (p) f A (p) .

Theorem 3.9 Let and be two IFA-UMs such that L and L be the intuitionistic fuzzy behavior of
and respectively. Let ( , ) be a strong homomorphism and if is bijective then L x =
L x

and L x = L x

x .

Proof: Let x ,

L ( (x)) iB (p') B (p', (x),q') f B (q') | q' Q B | p ' QB

and

L ( (x)) i B (p') B (p', (x),q') f B (q') | q' Q B | p ' QB

Since QB is finite there exists r ', s ' QB such that
L ( (x)) iB (r') B (r', (x),s') f B (s')
and

L x

i B (r') B (r', (x),s') f B (s')

Since is onto, there exists r , s QA such that (r) r' and (s) s' .
Therefore,

iB (r) B r , (x), (s) f B (s) ,

L x

L ( (x)) i (r) B r , (x), (s) f (s)

B
B
By Theorem 3.7 and Lemma 3.8, we get
L x = L x and L x = L x

IV.

x .

Admissible Relation

Definition 4.1 Let be an IFA-UM and be an equivalence relation on Q. Then

relation if and only if for all p, q, r Q, a , if p~q, A p, a, r > 0 and A

exists a t Q such that A p, a, r = A q, a, t and A p, a, r = A q, a, t , t~r.
Theorem 4.2 Let be an IFA-UM and be an equivalence relation on Q. Then

relation if and only if for all p, q, r Q, x , if p~q, A p, x, r > 0 and A

exists a t Q such that A p, x, r = A q, x, t and A p, x, r = A q, x, t , t~r.
Proof: Suppose is an admissible relation on Q. Let p, q Q be such that p q .

is called an admissible
p, a, r < 1, then there
is called an admissible
p, x, r < 1, then there

Let x , r Q be such that A p, x, r > 0 and A p, x, r < 1.

We prove the result by induction on x = n. The result is true for n = 0.

Assume that the result is true x , x < n. Let x = n, x = ya, where

y , a , y = n 1.
Let p, q Q, p~q and A p, x, r > 0, A p, x, r < 1.
Therefore, A p, ya, r = A p, y, q1 A q1 , a, r q1 Q > 0 and
A p, ya, r = A p, y, q1 A q1 , a, r q1 Q < 1.
Since Q is finite, there exists s Q such that A p, ya, r = A p, s, r A s, a, r > 0
www.iosrjournals.org

55 | Page

An Intuitionistic Fuzzy Finite Automaton on Homomorphism and Admissible relation

and A p, ya, r = A p, y, s A s, a, r < 1, therefore, A p, y, s > 0 and A s, a, r > 0, A s, a, r < 1.
By induction, there exists t s Q such that A p, y, s = A q, y, t s and A p, y, s = A q, y, t s , t s ~s.
Now A s, a, r > 0 and s~t s then there exists t Q such that A s, a, r = A (t s , a, t) and
A s, a, r = A t s , a, t , r~t, therefore, A p, ya, r = A q, y, t s
A t s , a, t and
A p, ya, r = A q, y, t s A t s , a, t .
Since is an IFA-UM, the maximum or minimum will be arrived for any r ~t s only.
Therefore, A p, ya, r = {A q, y, r A r , a, t |r Q} = A q, ya, t , r~t .
i.e.,
A p, ya, r = A q, x, t , r~t and
A p, ya, r = {A q, y, r A r , a, t |r Q} = A q, ya, t , r~t.
i.e.,
A p, ya, r = A q, x, t , r~t .
Thus, the result is true for x = n . Hence the result.
Lemma 4.3 Let be an IFA-UM and be an admissible relation on Q. Then there exists a fuzzy subset
A 1 : Q1 Q1 0,1 , where Q1 = Q ~. Moreover, A 1 is a fuzzy function of Q1 0,1 into Q1 .
Proof: Let q Q and [q] be the equivalence class of q i.e., [q] = {p Q|q~p}.
Let Q1 = Q ~ = q q Q . Define A 1 : Q1 Q1 0,1 and A 1 : Q1 Q1 0,1
by
A 1 p , a, q = A p, a, q
(1)
A 1 ( p , a, q ) = A p, a, q , r q , p Q, a
(2)
Suppose p , a, q = ([p ], a, [q ]). Therefore p = p , a = b, q = [q ] implies that p p and q q .
Let A (p,a, r) 0, A (p,a, r) 1, r [q] and p p' . Since is an admissible relation on Q , there exists t Q
such that
(3)
A (p,a, r) A (p',a, t), A (p,a, r) A (p',a, t), t r
r [q] implies that r [q'] and so t [q'] . By definition of A1 ,

A (p',a, t) A [p'],a,[q'] , A (p',a, t) A [p'],a,[q']

1

(4)

From (1),(2),(3) and (4)

A1 [p],a,[q] A1 [p'], b,[q'] and A1 [p],a,[q] A1 [p'], b,[q'] . Therefore, A1 is well-defined.
We shall prove A1 is a fuzzy function.
Let A1 [p],a,[q] A1 [p'],a,[q'] 0 and A1 [p],a,[q] A1 [p],a,[q'] 1 . Therefore there exists r , r ' Q
such that A1 [p],a,[q] A (p,a, r), A1 [p],a,[q] A (p,a, r) and r q ,

A [p],a,[q'] A (p,a, r'), A [p],a,[q'] A (p,a, r') and r ' q ' .

1

Therefore, A (p,a, r) A (p,a, r'), A (p,a, r) A (p,a, r') . Since is an IFA-UM, r r ' , therefore r q and
r q ' . Hence q q ' and [q] [q'] . Therefore, A1 is a fuzzy function from Q1 [0,1] into Q1 .
Definition 4.4 Let = (Q, , A,i,f) be an IFA-UM and be an equivalence relation on Q.
Let Q1 Q/ . Define the IFA-UM 1 = (Q1 , , A1 ,i1 ,f1 ) , where A1 is a fuzzy subset A1 : Q1 Q1 [0,1]
such that [p],[q] Q1 , A1 [p],a,[q] A (p,a, r), A1 [p],a,[q] A (p,a, r), r [q] .

iA : Q1 [0,1], i A : Q1 [0,1] such that

1
1

i A [p] i A (q) | q [p] , i A [p] i A (q) | q [p]

1

f A : Q1 [0,1], f A : Q1 [0,1] such that

1
1

f A [p] f A (q) | q [p] , f A [p] f A (q) | q [p] .

1

Theorem 4.5 Let IFA-UM and 1 be as in the definition 4.4. Then there exists a strong homomorphism
from to 1 .
Proof: The proofs are straightforward.

V.

Conclusion

In this paper, the algebraic nature of intuitionistic fuzzy finite automata under homomorphism and
strong homomorphism of IFA-UMs is dealt with some results and illustrated with an example. Finally, the
authors have made a humble beginning in this direction. However, the work highlights on the possibility of
further research on fuzzyfying many more concepts in the context of IFA-UM.
www.iosrjournals.org

56 | Page

An Intuitionistic Fuzzy Finite Automaton on Homomorphism and Admissible relation

References
[1].
[2].
[3].
[4].
[5].
[6].
[7].
[8].
[9].
[10].
[11].
[12].

K.T. Atanassov, Intuitionistic fuzzy sets, Fuzzy Sets and Systems, vol. 20, no.1,(1986),87-96.
K.T. Atanassov, More on intuitionistic fuzzy sets, Fuzzy Sets and Systems, vol. 33, no.1,(1989a),37-46.
K.T. Atanassov, New operations defined over the intuitionistic fuzzy sets, Fuzzy Sets Syst vol.61, no.2,(1994),137-142.
P.Burillo ,H.Bustince, Vague sets are intuitionistic fuzzy sets, Fuzzy Sets Syst vol.79, (1996),403-405.
Y.B.Jun, Intuitionistic fuzzy finite state machines, J. Appl. Math. Comput. vol.17, no.1-2,(2005),109-120.
E.T. Lee, L.A. Zadeh, Note an fuzzy languages, Infom. Sci. vol. 1,(1969),421-434.
D.S. Malik and J.N. Mordeson, Fuzzy Automata and languages, theory and applications,{CRC}, 2002.
T. Rajaretnam and S. Ayyaswamy, Fuzzy finite State Automaton with Unique Membership transition on an input Symbol, The
journal of Combinatorial Mathematics and combinatorial computing, vol. 69,(2009),151--164.
Telesphor Lakra, A.Jeny Jordon, K. Jency Priya and T. Rajaretnam, Intuitionistic Fuzzy Finite Automata with Unique membership
transitions, Proceedings of IEEE Xplore,(2014),103-107
E.S. Santos, Maximum automata, Inform Control, vol. 12,(1968),367-377.
W.G. Wee, and K.S. Fu, A formulation of fuzzy automata and its applications as a model of Learning systems, IEEE Trans. on
Systems Science and Cybernetics, SSC,(1969),215-223.
L.A. Zadeh, Fuzzy sets}, Inform Control, vol. 8,(1965),338-353.

www.iosrjournals.org

57 | Page