Paper Tayyari

Lecture 2: Kleene's Star Closure

MCQs, short and long questions from lecture 2.Lecture 2 ki MCQs, short aur long sawal.

4 MCQs · 4 short · 1 long question · 4 MCQs from past papers4 MCQs · 4 short · 1 long sawal · 4 MCQs past papers se

Start mock testMock test shuru karein
DoneHal kiye 0/4
– correctsahi
1.
★ Midterm Spring 2010

Languages generated by kleene star are always ______________.

  1. AFinite
  2. BInfinite
  3. CSometimes finite & sometimes infinite
  4. DNone of the these

As taught, the closure of a set with a non-null string contains infinitely many strings.

2.
★ Midterm Spring 2010

Let S = {aa, bb} be a set of strings then s* will have

  1. AΛ
  2. Babba
  3. Caabbbaa
  4. Dbbaab

S* always contains Λ, and the other strings cannot be split into aa and bb.

3.
★ Midterm Spring 2009

If S = {aa, bb}, then S* will not contain..

  1. Aaabbaa
  2. Bbbaabbbb
  3. Caaabbb
  4. Daabbbb

aaabbb has an odd run of a's, so it cannot be built from aa and bb.

4.
★ Midterm Spring 2009

S = {baa, ab}, then S* will not contain

  1. Aabbaab
  2. Babab
  3. Cbaabaa
  4. Dabbaa

abbaab splits as ab, baa and a leftover b, so it is not in S*; the others can be split.