48 (IJCNS) International Journal of Computer and Network Security,

Vol. 2, No. 10, 2010

Some Results of T-Fuzzy Subsemiautomata over

Finite Groups
M. Basheer Ahamed1 and J.Michael Anna Spinneli2
Department of Mathematics, Karunya University, Coimbatore-641114, Tamilnadu, INDIA.
1
basheer.ahamed@rediffmail.com; 2micheal.maths@gmail.com

Abstract: In 1965, Zadeh introduced the concept of fuzzy sets. t- norm on [0,1] unless otherwise specified. By an abuse of
Wee introduced the concept of fuzzy automata in 1967. Malik et notation we will denote
al. introduced the concept of fuzzy state machines and fuzzy
transformation semi groups based on Wee’s concept of fuzzy
T (a1,T (a 2,T (.......,T (a n−1 , a n )....)))
automata in 1994. A group semiautomaton has been extensively byT (a1 ,.......a n ) where a1 , a 2 ,.....a n ∈ [0,1] . The
studied by Fong and Clay. Das fuzzified this concept to
introduce fuzzy semiautomaton over a finite group. Sung-jin legitimacy of this abuse is ensured by the associativity of T
cho, jae- Gyeom Kim, Seok-Tae Kim introduced the notion of T- (Definition 2.1(4)).
fuzzy semiautomaton, T-fuzzy kernel and T-fuzzy Note: For further discussions we are considering ( G , + ) as
subsemiautomaton over a finite group. In this paper, we further
give some properties of T-fuzzy subsemiautomaton over finite a finite group.
groups. 2.2 Definition [1]
A fuzzy subset λ of G is called a T – fuzzy subgroup of G if
Keywords: T-fuzzy normal subgroup, T-fuzzy kernel, T-fuzzy (i) λ ( x + y) ≥ T (λ ( x), λ ( y)),
subsemiautomata. (ii) λ ( x) = λ (− x) for all x, y ∈ G .
1. Introduction 2.3 Definition [1]

Fuzzy automata concept was introduced by Wee in 1967 A T – fuzzy subgroup λ of G is called a T- fuzzy normal
[8].Using this concept Malik et al. [5] introduced the subgroup of G if
concept of fuzzy state machines and fuzzy transformation λ ( x + y) = λ ( y + x) for all x, y ∈ G .
semigroups. A Group semiautomata has been extensively
studied by Fong et al [3].This concept was fuzzified by Das 2.4 Definition [1]
[2], and he introduced fuzzy semiautomaton over finite
groups. The notion of T fuzzy semiautomaton over finite A triple M = (Q, X ,τ ) where (Q, + ) is a finite group, X
group was introduced by Kim and Cho [1]. In this paper we is a finite non empty set and τ is a fuzzy subset of
have got some more results of T fuzzy subsemiautomaton Q × X × Q , that is τ is a function from Q × X × Q to
and T fuzzy kernel. [0,1],is called a fuzzy semiautomaton
2. Preliminaries if ∑τ ( p, a , q) ≤ 1 for all
q∈Q
p ∈ Q and a ∈ X. If
In this section we summarize the preliminary definitions,
and results that are required for developing main results. ∑τ ( p, a , q) = 1 for all p ∈ Q and a ∈ X , then M
q∈Q
is

2.1 Definition [1] said to be complete.

[ ]
A binary operation T on 0,1 is called a t- norm if
2.5 Definition [1]
(1) T ( a ,1) = a
(2) T ( a , b) ≤ T ( a , c ) whenever b ≤ c Let M = (Q, X ,τ ) be a fuzzy semiautomaton.
(3) T ( a , b) = T (b, a ) Define τ : Q × X × Q → [0,1] by
* *

p=q
(4) T ( a , T ( b, c )) = T (T ( a , b ), c ) for all a , b , c ∈ [0,1] .
The maximum and minimum will be written as ∨ and ∧ ,
τ * ( p , Λ , q ) = { 10 iiff p≠q
respectively. Define T0 on [0,1] by T(τ ( p, a1 , q1 ), 
T0 (a ,1) = a = T0 (1, a ) and  
and τ * ( p, a1.....an , q) = ∨ τ (q1 , a2 , q2 )....., 
T0 (a , b) = 0 if a ≠ 1 and b ≠ 1 for all a , b ∈ [0,1] Here τ q , a , q ) / q ∈Q
T always will mean a t- norm on [0,1] . A t-norm T on  ( n−1 n ) i 
[0,1] is said to be ∨ distributive if where p, q ∈ Q a1 ,.....a n ∈ X. When T is applied on M as
T ( a , b ∨ c) = T (a , b ) ∨ T (a , c ) for all a , b, c ∈ [0,1]. Throu above, M is called a T-fuzzy semiautomaton.
ghout this paper, T shall mean a ∨ - distributive
 (IJCNS) International Journal of Computer and Network Security, 49
Vol. 2, No. 10, 2010

Note: Hereafter, a fuzzy semiautomaton always will be Proof:

written as a T-fuzzy semiautomaton because a fuzzy
Suppose that the given condition is satisfied.
semiautomaton always induces a T-fuzzy semiautomaton as
in Definition 2.5. For all p, q, r ∈ Q and x ∈ X . We have
2.6 Definition [1]
µ ( p) = µ ( p − r + r )
A fuzzy subset µ of Q is called a T- fuzzy kernel of a T-
≥ T ( µ ( p − r ), µ (r ))
fuzzy semiautomaton M = (Q , X , τ )
(i) µ is a T- fuzzy normal subgroup of Q . ≥ T (T (τ (e + q, x, p),τ (e, x, r ), µ (q)), µ (r ))
(ii) µ ( p − r ) ≥ T (τ ( q + k, x, p),τ ( q, x, r ), µ ( k)) By definition 2.6
for all p, q, r , k ∈ Q, x ∈ X .
≥ T (τ (e + q, x, p),τ (e, x, r ), µ (q), µ (e))
2.7 Definition [1]
By given condition
A fuzzy subset µ of Q is called a T- fuzzy subsemiautomaton
of a T-fuzzy semi automaton M = (Q , X , τ ) if ≥ T (τ (e + q, x, p ), µ (q )) Since µ ( e ) ≥ µ ( p ) ,
(i) µ is a T – fuzzy subgroup Q , µ ( e, x, r ) ≥ µ ( e + q, x, p )
(ii) µ ( p ) ≥ T (τ ( q , x, p ), µ ( q )) for all p, q ∈ Q , x ∈ X .
= T (τ (q, x, p), µ (q ))
2.8 Definition [7]
Then, µ is a T- fuzzy sub semiautomaton of
Let λ and µ be T- fuzzy subsets of G, then the sum of
M = (Q , X , τ ) and the converse is immediate.
λ and µ is defined by 3.2 Example
T (λ ( y), µ ( x)) / y, z ∈ G 
(λ + µ )( x) = ∨   Consider a finite T fuzzy semiautomaton
 such that x = y + z  M = (Q , X , τ ) where Q = { p, q, r , k} and
for all x ∈ G .
X = {a , b}
2.9 Remark
Let λ be a fuzzy subset of G. Then λ will be a fuzzy b/0.4
subgroup of G depending on the membership values that we
are choosing. Let us see the following examples. a/0.3
p q
2.10 Example [4]

Let G = {e, a , b, c} be the Klein four groups. Define the

b/0.1

fuzzy subset A of G by
A( e ) = 1, A( a ) = 1, A( b ) = 3 / 4, A( c ) = 3 / 4 .Clearly a/0.2
A is a fuzzy subgroup of G.
b/0.2
k r

2.11 Example [6]

Let G = {e, a , b, c} be the Klein four groups. Define the

fuzzy set λ of G defined by a,b/0.2 a/0.4
λ ( e ) = 0.6, λ ( a ) = 0.7, λ ( b ) = 0.4, λ ( c ) = 0.4 .Clear Figure 1. Finite T-fuzzy semiautomaton
ly λ is not a fuzzy group of G.
Clearly, τ is a T-fuzzy kernel. Let µ be a fuzzy subset of
3. Main results Q defined by µ ( p ) = 0.4 ,
This section consists of some more results of T fuzzy µ ( q ) = 0.2 , µ ( r ) = 0.1, µ ( k ) = 0.1 .T-norm is defined
subsemiautomaton and T fuzzy kernel.
3.1 Proposition by T ( a , b ) = ∨ {a + b − 1, 0}

Let µ be a T- fuzzy kernel of a T fuzzy semiautomaton ( Q, + ) is a group defined by

M = (Q , X , τ ) over a finite group Q .Then µ is a T- fuzzy p + p = p, p + q = q, p + r = r , p + k = k
subsemiautomaton M if and only if q + p = q, q + q = p, q + r = k, q + k = r
µ ( p ) ≥ T (τ (e, x, p), µ (e)) for all p ∈ Q, x ∈ X .
50 (IJCNS) International Journal of Computer and Network Security,
Vol. 2, No. 10, 2010

r + p = r , r + q = k, r + r = q, r + k = p Let µ be a fuzzy subset of Q defined

k + p = k, k + q = r , k + r = p, k + k = q by µ ( p ) = 0.4 , µ ( q ) = 0.1 , µ ( r ) = 0.25 , µ ( k ) = 0.25
p is the identity element. Clearly, µ is a T-fuzzy kernel.et ν be a fuzzy subset of Q
q −1 = q, r −1 = k, k −1 = r defined byν ( p ) = 0.6 ,
Then, µ is a T-fuzzy subsemiautomaton.
3.3 Proposition ν ( q ) = 0.2 ,ν ( r ) = 0.1 , and ν ( k ) = 0.1 .
Clearly ν is T-fuzzy subsemiautomaton.T-norm is defined
Let µ be a T- fuzzy kernel, and ν be a T- fuzzy by T ( a , b ) = ab , ( Q, + ) is a group defined by
subsemiautomaton of M = (Q , X , τ ) . Then µ + ν is a T-
p + p = p, p + q = q, p + r = r , p + k = k
fuzzy subsemiautomaton of M .
q + p = q, q + q = p, q + r = k, q + k = r
Proof:
r + p = r , r + q = k, r + r = q, r + k = p
( µ +ν )( p ) = ( µ +ν )( p + r − r ) k + p = k, k + q = r , k + r = p, k + k = q
≥ T ( µ ( p − r ) ,ν (r ) ) p is the identity element. We have
≥ T (τ ( a + b, x, p ) ,τ ( a , x, r ) , µ ( b ) ,τ ( a , x, r ) ,ν ( a ) ) q −1 = q, r −1 = k, k −1 = r .
By definition 2.6 Then ( µ + ν ) is a T-fuzzy subsemiautomaton
≥ T (τ ( a + b, x, p ) , µ ( b ) ,ν ( a ) ) of M = (Q , X , τ ) .
Since τ ( a + b, x, p ) ≤ τ ( a , x, r ) 3.5 Theorem
Then for all p, q ∈ Q, x ∈ X
Let µ and ν are T-fuzzy kernels of M = (Q, X ,τ ) . Then
T (τ ( a + b, x, p ) , µ ( b ) ,ν ( a ) ) :
( µ + ν )( p ) ≥ ∨  
µ + ν is a T-fuzzy kernel of M = (Q , X , τ ) .
a + b = q, a , b ∈ Q 
Proof:
Since µ and ν are T-fuzzy normal subgroups of Q ,
( { }
≥ T τ ( a + b, x, p) ,∨ T( µ( b) ,ν ( a ) ) : a +b = q, a,b∈Q ) ( µ +ν ) is also a T-fuzzy normal subgroup.
= T (τ ( a + b, x, p ) , ( µ + ν )( q ) ) ( µ +ν )( p − r ) = ( µ +ν )( p − q + q − r )
≥ T ( µ ( p − q ) ,ν ( q − r ) )
By definition 2.8
= T (τ ( q, x, p ) , ( µ + ν )( q ) )
 T (τ ( a + b + c, x, p ) ,τ ( a + b, x, q ) , µ ( c ) ) , 
Hence ( µ + ν ) is a T- fuzzy subsemiautomaton. ≥T 
 T (τ ( a + b, x, q ) ,τ ( a , x, r ) ,ν ( b ) ) 
3.4 Example  
Consider a finite T fuzzy semiautomaton M = (Q , X , τ ) By definition2.6

where Q = { p, q, r , k}
τ ( a + b + c, x, p ) ,τ ( a + b, x, q ) , 
=T 
 µ ( c ) ,τ ( a , x, r ) ,ν ( b )
and X = {a }  
a/0.4
= T (τ ( a + b + c, x, p ) , µ ( c ) ,τ ( a , x, r ) ,ν ( b ) )
q Since τ ( a + b + c, x, p ) ≤ τ ( a + b, x, q ) .
p
Then for all p, q, r , k ∈ Q and x ∈ X
( µ +ν )( p − r )
a/0.1 T (τ ( q + b + c, x, p ) ,τ ( q, x, r ) µ ( c ) ,ν ( b )) :
≥ ∨ 
b, c ∈ Q, b + c = k 
a/0.3
r
= T
{ }
τ ( q + b + c, x, p) ,τ ( q, x, r ) , ∨ T ( µ ( c) ,ν ( b) ) :

k  b, c ∈Q,b + c = k 
 
= T (τ ( q + k, x, p ) ,τ ( q, x, r ) , ( µ + ν )( k ) ) Hence
a/0.2
( µ +ν ) is a T-fuzzy kernel of M = (Q, X ,τ ) .
Figure 2. Finite T-fuzzy semiautomaton 3.6 Example
 (IJCNS) International Journal of Computer and Network Security, 51
Vol. 2, No. 10, 2010

Consider a finite T-fuzzy semiautomaton M = (Q , X , τ ) , ν ( p ) = 0.1,ν ( q ) = 0.2,ν ( r ) = 0.2,ν ( s ) = 0.2,

where Q = { p, q, r , s, t , u} ,
Clearly,
ν ( t ) = 0.2,ν ( u ) = 0.1
X = {a } ν is a T-fuzzy kernel
Then, ( µ + ν ) is a T-fuzzy kernel of

q M = (Q , X , τ ) .
a/0.1 a/0.1
References
[1] S. J. Cho, J. G. Kim, S. Tae Kim, T-fuzzy
p semiautomata over finite groups, Fuzzy sets and
u systems 108 (1999) 341-351.
[2] P.Das, On some properties of fuzzy semiauto-
maton over a finite group, Information Sciences
101 (1997) 71-84.
a/0.2 [3] Y. Fong, J.R. Clay, Computer programs for
a/0.1
investigation syntactic near rings of finite group
semiautomata, Academia Sinica 16 (4) (1988) 295-
304.
t r [4] D. S. Malik, J. N. Mordeson, and P.S. Nair,
Fuzzy normal subgroups in fuzzy subgroups,
J. Korean Math. Soc. 29 (1992), No. 1, 1–8.

a/0.1 [5] D. S. Malik, J. N. Mordeson, and M. K. Sen,

a/0.3
s [6] Sandeep Kumar Bhakat, ( ∈ , ∈ ,Vq) - fuzzy
Figure 3. Finite T-fuzzy semiautomaton
Here ( Q, + ) is a group defined by
p + p = p , p + q = q , p + r = r , p + s = s,
p + t = t, p + u = u
q + p = q , q + q = s, q + r = u , q + s = p ,
q + t = r, q + u = t
r + p = r , r + q = u , r + r = q, r + s = t ,
r + t = p, r + u = s
s + p = s, s + q = p , s + r = t , s + s = q ,
s + t = u, s + u = r
t + p = t , t + q = r , t + r = p, t + s = u,
t + t = s, t + u = q
u + p = u , u + q = t , u + r = s, u + s = r ,
u + t = q, u + u = p
p is the identity element. We have
p −1 = p, q −1 = s, r −1 = t , s −1 = q, t −1 = r , u −1 = u T-
norm is defined by T ( a , b ) = ab
Let µ be a fuzzy subset of Q defined by
µ ( p ) = 0.1 , µ ( q ) = 0.2 , µ ( r ) = 0.1, µ ( s ) = 0.2 ,
µ ( t ) = 0.1 , µ ( u ) = 0.3
Clearly, µ is a T-fuzzy kernel.
Let ν be a fuzzy subset of Q defined by
On subsystems of a fuzzy finite state machines,
Fuzzy sets and systems 68 (1994) 83-92.
normal, quasinormal and maximal subgroups, Fuzzy
Sets and Systems 112 (2000) 299-312
[7] Sessa, On fuzzy subgroups and fuzzy ideals under
triangular norms, Fuzzy Sets and Systems
13(1984) 95-100.
[8] W.G. Wee, On generalizations of adaptive
algorithm and application of the fuzzy sets
concept to pattern classification, Ph.D., Thesis,
Purdue University, 1967.
[9] L.A. Zadeh, Fuzzy sets, Info. and Control 8
(1965) 338–353.
Author’s Profile
Basheer Ahamed M received the Ph,D.,
degree in Mathematics from Bharathidasan
University, Tiruchirappalli, Tamilnadu in
2005. He is working as Associate Professor of
Mathematics in Karunya University,
Coimbatore, India. His research areas are
Fuzzy Mathematics and Discrete Mathematics.
J. Michael Anna Spinneli received her M.Sc
and M.Phil degrees in mathematics from
Manonmanium Sundaranar.University.
Tirunelveli, Tamilnadu. Now she is working
as an Assistant Professor of mathematics in
Karunya University, Coimbatore, India. She is
doing research on Fuzzy Automata.