Scribd
Upload
43 views14 pages

Lecture 3 Kleen's Star and Plus Oprator

The lecture covers Kleene's Star and Plus operations in Automata Theory, explaining their definitions and differences. Kleene's Star generates all possible strings including the empty string, while the Plus operation generates non-empty strings only. The document also includes examples and a theorem demonstrating the equality of Kleene star operations on sets of words.

Uploaded by

ayeshanadeem2408
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
43 views14 pages

Lecture 3 Kleen's Star and Plus Oprator

The lecture covers Kleene's Star and Plus operations in Automata Theory, explaining their definitions and differences. Kleene's Star generates all possible strings including the empty string, while the Plus operation generates non-empty strings only. The document also includes examples and a theorem demonstrating the equality of Kleene star operations on sets of words.

Uploaded by

ayeshanadeem2408
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/ 14

Lecture # 3

(Automata Theory)
Instructor
Waheed Ahmad Khan
CUI Wah Campus
 Topic Covered
1. Kleen’s Star Or Kleen’s Cloure (*)
2. Kleen’s Plus (+)
Kleene Star Closure *

 Given Σ, then the Kleene Star Closure


of the alphabet Σ, denoted by Σ*, is
the collection of all strings defined
over Σ, including Λ.
 It is to be noted that Kleene Star
Closure can be defined over any set
of strings
Examples
 If Σ = {x}
 Then Σ* = {Λ, x, xx, xxx, xxxx, ….} If Σ =
{0,1}
 Then Σ* = {Λ, 0, 1, 00, 01, 10, 11, ….}
 If Σ = {aaB, c}
 Then Σ* = {Λ, aaB, c, aaBaaB, aaBc,
caaB, cc, ….}

Kleene Star Closure *

 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 many words, each of finite
length).
Examples:

L = {a, ab}
 L* = {^, a, aa, ab, aaa, aab, aba,
aaaa, …} abaaababa L* (ab|a|a|
ab|ab|a factors)
 L* = {^ plus all sequences of a’s
and b’s except those that start
with b and those that contain a
double b}
Kleene Star Closure *
 L = {xx, xxx} xxxxxxx  L*
xx|xx|xxx xx|xxx|xx xxx|xx|xx
 L* = { and all sequences of more than

one x}
 = {xn : x≠1}


If L =  then L* = {}
 The Kleene closure L*, of a language L,

always produces an infinite language


unless L is empty or L={}.
Kleene Star Closure *
 Example:
S = {a, b, ab} T = {a, b, bb}
S*= T* although S ≠ T ab|a|a|ab|ab|a
a|b|a|a|a|b|a|b|a
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,
….}
Remark
* VS +
 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,
 Theorem 1: For any set of
words S, we have S*=S**.
 Definitions:
 equalityof sets S = T: S  T et T  S
subsets S  T: for all x in S, x is also in T
 Example: S = {a,b}

 aaba, baaa, aaba S*

 aaba|baaa|aaba S** a|a|b|a|b|a|a|a|a|a|b|a

S*
S*=S**
 Proof of Theorem 1: S*=S** :

Case 1: S**  S*
 Every word in S** is made up of factors from S* (definition of Kleene
star). Every word in S* is made up of factors from S. Therefore, every
word in S** is also a word in S*. Thus S**S*.

Case 2: S*  S**
For any set A, we can show that A  A*. Let w be a word in A. Then w
is certainly in A*. If we consider S* as our set A, we can conclude S* 
S**.
By definition of equality of sets, we have S*

= S**
Assiginment 1
 Slove the Exercise of Chapter 2
Languages
 By Danial I . A Choen
Thank You…

You might also like