Scribd
Upload
1 views2 pages

BCS503 M2 SQ

The document outlines various topics related to Regular Expressions (RE), including definitions, applications, closure properties, and notations used in UNIX. It also includes exercises for constructing REs, proving equivalences between REs and finite automata, and applying the Pumping Lemma to demonstrate non-regular languages. Additionally, it discusses minimizing Deterministic Finite Automata (DFA) and provides tasks for constructing and minimizing automata.

Uploaded by

anushaanu87623
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
1 views2 pages

BCS503 M2 SQ

The document outlines various topics related to Regular Expressions (RE), including definitions, applications, closure properties, and notations used in UNIX. It also includes exercises for constructing REs, proving equivalences between REs and finite automata, and applying the Pumping Lemma to demonstrate non-regular languages. Additionally, it discusses minimizing Deterministic Finite Automata (DFA) and provides tasks for constructing and minimizing automata.

Uploaded by

anushaanu87623
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/ 2

Module-2:

2.1 Regular Expression


a. Define Regular Expression. Write applications of RE. 3+4
b. List out closure properties of Regular sets. 6M
c. What are the notations used in UNIX operation system ? List few RE’s with its UNIX
notations. 6M
d. Using Kleen's theorem, prove that any language that can be defined with a Regular
Expression can be accepted by some FSM . 6M
e. Prove that for every RE, there is an equivalent finite automaton. (6M)

2.2 Construct Regular expressions for the given languages :


a. Obtain NDFSM for the Regular expression (a+b)* abb and (a* + ab) aab* 6M

b. Develop RE for the following Language on 𝛴={a,b}


i. Obtain NFA which accepts strings of a’s and b’s starting with the string ab
ii. Accept strings of a’s and b’s whose fifth symbol from the right end is ‘a’.
iii. Accept strings of a’s and b’s whose 2nd symbol from the right end is ‘a’.
iv. Obtain RE to accept words with two or more letters but beginning and ending with
the same letter where {a, b} are inputs
v. Accept strings of a’s and b’s containing not more than 3 a’s

c. Write RE for the following Languages


i) L = {a2n b2m | n>=0, m>=0}
ii) L = {w : |w| mod 3 = 0 where w ∈ {a,b}*}
iii) Language of all strings of 0's and l's that has at least one pair of consecutive 0's

d. Write RE for the following:


L={anbm | m+n is even}
L={anbm | m>=1, n>= 1, nm=3}
L={a2nb2m | n>=0, m>=0 }

e.
.i .Find Regular language accepted by the following FA by eliminating states ?

9M

ii.Obtain ∈ −NFA for the RE (a+b)*bb(a+b)*


iii.Construct an ∈ −NFA for the regular expression 0+01* 5M
iv.Construct on FA for the RE 10+(0+11)0*1 5M

2.3 Pumping Lemma Theorem for Regular languages(Proving Languages not to be Regular ) :
a. State and prove the Pumping Lemma Theorem for Regular languages 8 marks
b. Prove that the language L= {anbn | n>=0} is not regular. 6 marks
c. Prove that the language L= {aibj | i>j} is not regular. 6marks
d. Prove that following languages are not regular using Pumping Lemma.
 L={wwR |wϵ{a,b}*}
 L={aP |P is a prime number}
 L={na(w)=nb(w) | wϵ{a,b}*}
 L={an! :n>=0}

2.4 Minimize the given DFA:


a. Find the minimized DFA of the following

10M

b. Construct a minimum state automation equivalent to the FA given table

c. Minimize the following by identifying distinguishable and non distinguishable states.

You might also like