Scribd
Upload
21 views22 pages

Lesson 02

The document discusses the Kleene Star Closure, which is the collection of all possible strings over a given alphabet, including the empty string. It provides examples of Kleene Star and Plus operations, along with tasks and solutions related to these concepts. Additionally, it outlines the recursive definition of languages with specific examples, emphasizing the construction rules for defining various languages.

Uploaded by

kashafbutt72
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
21 views22 pages

Lesson 02

The document discusses the Kleene Star Closure, which is the collection of all possible strings over a given alphabet, including the empty string. It provides examples of Kleene Star and Plus operations, along with tasks and solutions related to these concepts. Additionally, it outlines the recursive definition of languages with specific examples, emphasizing the construction rules for defining various languages.

Uploaded by

kashafbutt72
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 22

Kleene Star Closure

 Given Σ, then the Kleene Star Closure


of the alphabet Σ, is the collection of all
possible strings defined over Σ,
including Λ, and is denoted by Σ*
 It is to be noted that Kleene Star
Closure can be defined over any set of
strings.

1
Examples

 If Σ = {x} Then the closure of an alphabet is


Σ* = {Λ, x, xx, xxx, xxxx, ….}
 If Σ = {0,1} Then the closure of an alphabet is
Σ* = {Λ, 0, 1, 00, 01, 10, 11, ….}
 If Σ = {aaB, c} Then the closure of an alphabet
is
Σ* = {Λ, aaB, c, aaBaaB, aaBc, caaB, cc, ….}

2
Important Note

 Languages generated by Kleene Star


Closure of set of strings, are infinite
languages.
 (By infinite language, it is supposed that
the language contains infinite words,
each of finite length).
 Word: A string defined over an alphabet
accepted by the language is called a word
of that language.
 Remarks: Every word is a string but
converse may or may not true. 3
Task
 Questions?
1) Let S={ab, bb} and T={ab, bb, bbbb}
Show that S* = T* [Hint S*  T* and T*  S*]
2) Let S={ab, bb} and T={ab, bb, bbb}
Show that S* ≠ T* But S*  T*
3) Let S={a, bb, bab, abaab} be a set of
strings. Are abbabaabab and
baabbbabbaabb in S*? Does any word
in S* have odd number of b’s?

4
Solutions
 Answers:
1) Let S={ab, bb} and T={ab, bb, bbbb} Show
that S* = T* [Hint S*  T* and T*  S*]
2) Let S={ab, bb} and T={ab, bb, bbb} Show
that S* ≠ T* But S*  T*
Solution: Since S  T , so every string
belonging to S* , also belongs to T* but bbb is
a string belongs to T* but does not belong to
S *.

5
Solutions

 3) Let S={a, bb, bab, abaab} be a set of strings.


Are abbabaabab and baabbbabbaabb in S *? Does
any word in S* have odd number of b’s?
Solution: since abbabaabab can be grouped as
(a)(bb)(abaab)ab , which shows that the last
member of the group does not belong to S, so
abbabaabab is not in S*, while baabbbabbaabb
can not be grouped as members of S, hence
baabbbabbaabb is not in S*. Since each string in S
has even number of b’s so there is no possiblity
of any string with odd number of b’s to be in S*.

6
PLUS Operation (+)

 Plus Operation is same as Kleene Star


Closure except that it does not generate Λ
(null string), automatically.
Example:
 If Σ = {0,1}
Then Σ+ = {0, 1, 00, 01, 10, 11, ….}
 If Σ = {aab, c}
Then Σ+ = {aab, c, aabaab, aabc, caab, cc,
….}
7
TASK

Q1)Is there any case when S+ contains Λ?


If yes then justify your answer.

Q2) Prove that for any set of strings S

i. (S+)*=(S*)*
ii. (S+)+=S+
iii. Is (S*)+=(S+)*

8
Solutions

Q1)Is there any case when S+ contains Λ?


If yes then justify your answer.
Solution: consider S={Λ,a} then
S+ ={Λ, a, aa, aaa, …}
Here Λ is in S+ as member of S. Thus
Λ will be in S+ , in this case.

9
Solutions Cont…

Q2) Prove that for any set of strings S

i. (S+)*=(S*)*
Solution: In general Λ is not in S+ , while
Λ does belong to S*. Obviously Λ will
now be in (S+)*, while (S*)* and S*
generate the same set of strings.
Hence (S+)*=(S*)*.

10
Solutions Cont…

ii) (S+)+=S+
Solution: since S+ generates all possible
strings that can be obtained by
concatenating the strings of S, so (S+)+
generates all possible strings that can
be obtained by concatenating the
strings of S+ , will not generate any
new string.
Hence (S+)+=S+
11
Q2) continued…

iii) Is (S*)+=(S+)*
Solution: since Λ belongs to S* ,so Λ
will belong to (S*)+ as member of
S* .Moreover Λ may not belong to S+,
in general, while Λ will automatically
belong to (S+)*.
Hence (S*)+=(S+)*

12
Remark

 It is to be noted that Kleene Star can also


be operated on any string i.e. a* can be
considered to be all possible strings defined
over {a}, which shows that a* generates
Λ, a, aa, aaa, …
It may also be noted that a+ can be
considered to be all possible non empty
strings defined over {a}, which shows that
a+ generates
a, aa, aaa, aaaa, …
13
Defining Languages Continued…

 Recursive definition of languages


The following three steps are used in
recursive definition
1. Some basic words are specified in the
language.
2. Rules for constructing more words are
defined in the language.
3. No strings except those constructed in
above, are allowed to be in the language.

14
Example

 Defining language of INTEGER


Step 1:
1 is in INTEGER.
Step 2:
If x is in INTEGER then x+1 and x-1 are also
in INTEGER.
Step 3:
No strings except those constructed in
above, are allowed to be in INTEGER.

15
Example

 Defining language of EVEN


Step 1:
2 is in EVEN.
Step 2:
If x is in EVEN then x+2 and x-2 are also
in EVEN.
Step 3:
No strings except those constructed in
above, are allowed to be in EVEN.

16
Example

 Defining the language factorial


Step 1:
As 0!=1, so 1 is in factorial.
Step 2:
n!=n*(n-1)! is in factorial.
Step 3:
No strings except those constructed
in above, are allowed to be in factorial.

17
 Defining the language L, of strings
ending in a , defined over Σ={a,b}
Step 1:
a is in L
Step 2:
if a is in L then s(a) is also in L, where s
belongs to Σ*
Step 3:
No strings except those constructed in
above, are allowed to be in L
18
 Defining the language L, of strings
beginning and ending in same letters ,
defined over Σ={a, b}
Step 1:
a and b are in L
Step 2:
(a)s(a) and (b)s(b) are also in L, where s
belongs to Σ*
Step 3:
No strings except those constructed in
above, are allowed to be in L
19
 Defining the language L, of strings
containing aa or bb , defined over
Σ={a, b}
Step 1:
aa and bb are in L
Step 2:
s(aa)s and s(bb)s are also in L, where s belongs
to Σ*
Step 3:
No strings except those constructed in
above, are allowed to be in L
20
 Defining the language L, of strings
containing exactly aa, defined over
Σ={a, b}
Step 1:
aa is in L
Step 2:
s(aa)s is also in L, where s belongs to b*
Step 3:
No strings except those constructed in
above, are allowed to be in L
21
Note

 EVEN-EVEN and PALINDROME languages


are non-recursive languages.

22

You might also like