Scribd
Upload
4 views3 pages

Lecture 3,4

The document explains the concepts of Kleene star and Kleene plus closures, which represent collections of strings over a given alphabet, including the empty string for Kleene star and excluding it for Kleene plus. It also outlines different methods for defining languages, including descriptive languages and recursive languages, with examples provided for each. The recursive language is defined through basic words and construction rules, ensuring only specified strings are included.

Uploaded by

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

Lecture 3,4

The document explains the concepts of Kleene star and Kleene plus closures, which represent collections of strings over a given alphabet, including the empty string for Kleene star and excluding it for Kleene plus. It also outlines different methods for defining languages, including descriptive languages and recursive languages, with examples provided for each. The recursive language is defined through basic words and construction rules, ensuring only specified strings are included.

Uploaded by

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

Kleene star closure

It is denoted by Ʃ*.
It is collection of all string defined over Ʃ, including ^ null.
In simple words it is undetermined power. Represent infinite number of terms
can be made including empty string. (0 or more)
e.g.
if Ʃ = {a}, Ʃ* =?
Ʃ* = {^, a, aa, aaa, aaaa ……a(n)}
e.g.
Ʃ = {a, b, c} find Ʃ*
Ʃ* = {a, b, c}*
Ʃ* = {^, a,b,c,ab,ac,bb,ba,bc,cc,ca,cb,abc ……a (n)}
e.g.
Kleene star in string:
S = ab*a
S = {aa,aba,abba,abbba,abbbba……..n}

Kleene plus / Kleene positive Closure


It is same as Kleene star closure except that it does not generate null string. (1
or more)
It is denoted by Ʃ+.
e.g.
Ʃ = {a, b, c}
Ʃ+ = {a , b, c, abc, acb, bca, aaa, …….. n}
e.g.
Kleene plus in string
S = ab + a S = {aba, abba, abbba………n}
There are Different method with which we can define language:
1. Descriptive Language
2. Recursive Language
3. Regular Expression (RE)
4. Finite Automata (FA)
5. Transition Graph (TG)

Descriptive Language
It described the condition imposed on its words.
e.g.
The language L of string of even length, defined over Ʃ = {c} can be written as;
L = {cc, cccc, cccccc, ………}
e.g.
Language does not start with ‘y’ language defined over Ʃ = {x, y, z};
L = {x, z, xy, zx, zy, xyz, ……}

Recursive Language
Describe in three steps:
1. Some basic words are specified in the language.
2. Rules for constructing more words are defined in the language.
3. No string except those constructed in above, are allowed to be in the
language.
e.g.
Defining language of positive even numbers using recursive definition;
• 2 is positive even number
• If x is positive even then so is, x + 2
• No string except those constructed in above, are allowed to be in positive
even.
Defining the language L, of string beginning and ending in same latter’s defined
over Ʃ = {a, b}
L = {aa, bb, abba, abababa, aabbaa, ……}
• a and b is a in language
• S (a) and (b) s (b) are also in language, where s belongs to Ʃ*.
• No string except those constructed in above, are allowed to be in L.

You might also like