Toafl PPT Unit2

Theory of Automata and Formal Languages
(KCS402)
Unit: II
Regular Expressions and Languages
B. Tech
(Computer Science & Engineering)
4th Semester
6/9/2022 VANDANA KCS-402 (TOAFL) Unit II 1

Index
• Course Outcomes
• Syllabus • Old University Exam Paper
• Contents of the Unit • Expected Questions for
• Objectives of the Unit University Exams
• CO- PO correlation w.r.t. Unit • Summary
• CO-PSO correlation w.r.t. Unit • References
• Prerequisite for the course
• Objectives of the topic
• Topic mapping with CO
• Video Links
• Daily Quiz
• MCQs
• Weekly assignment

Syllabus
UNIT-2
Regular Expressions and Languages: Regular Expressions, Transition

Graph, Kleen’s Theorem, Finite Automata and Regular Expression-
Arden’s theorem, Algebraic Method Using Arden’s Theorem,
Regular and Non-Regular Languages- Closure properties of Regular
Languages, Pigeonhole Principle,
Pumping Lemma, Application of Pumping Lemma,
Decidability- Decision properties, Finite Automata and Regular
Languages, Regular Languages and Computers, Simulation of
Transition Graph and Regular language.

Objective of Unit
Objective of the course is to make students able to:

• Write regular expression.
• Correlate between regular expression and FA.
• Apply Arden’s Theorem.
• Use pumping lemma for regular languages.

Regular Expression(RE)
• We have already discussed that languages accepted by Finite

Automata are called Regular Language.
• An expression that express the regular language is called the
regular Expression
• RE is written for the Regular Language using +, . , * is known as
Regular Expression.
Examples
• (a+b)
• (0+10*)
• (a+Ɛ)b*a
• (ab+ba)*

Regular Expression (CO1)
Regular Expression is a notation for specifying patterns.
Rules for Regular Expression:-
1. Ɛ is a regular expression that denotes language {Ɛ}, set containing the

empty string
2. If a is a symbol in ∑, then a is a regular expression that denotes language
{a}, the set containing string a.
3. If r & s are regular expression denoting language L(r) & L(s) then,
(r)|(s) is a regular expression denoting L(r)U L(s)
(r).(s) is regular expression denoting L(r)L(s)
(r)* is denoting (L(r))*
(r) Is regular expression denoting L(r)
6/9/2022 Ms. Vandana KCS-502 Unit 2 6

DFA, NFA, Ɛ-NFA and Regular Expression(RE)
RE
Ɛ-NFA DFA
NFA

Example
Example 1:- Write regular expression for the language accepting all strings
containing any number of a’s and b’s.
Solution:-
L={ ∑, a, aa, b, bb,ab….}
(a+b)*
Example 2:- Starting with 1 & ending with 0
Solution:-
L={10,110,100…..}
1(0+1)*0
6/9/2022 Ms. Vandana KCS-502 Unit 2 8

Conversion of Regular Expression to Finite Automata
We can use Thompson's Construction to find out a Finite Automaton from a Regular
Expression.
Some basic RA expressions are the following −
Case 1 − For a regular expression ‘a’, we can construct the following FA −
Case 2 − For a regular expression ‘ab’, we can construct the following FA −
6/9/2022 Ms. Vandana KCS-502 CD Unit 1 9

Case 3 − For a regular expression (a+b), we can construct the following FA −
Case 4 − For a regular expression (a+b)*, we can construct the following FA −
Steps to be followed by :-
1. Design a transition diagram for given regular expression, using NFA with λ-move
2. Convert this NFA with λ-move to NFA.
3. Convert the NFA to DFA.
Example
Example-1:- Design a finite automata from given regular expression 10+(0+11)0*1
Solution:-First we will construct the transition diagram for a given regular expression
Step 1:-
Step 2:-

Example
Step 3:-
Step 4:-

Step 5:-
Now we have got NFA without ε. Now we will convert it into required DFA for that, we
will first write a transition table for this NFA.
State 0 1
→q0 q3 {q1, q2}
q1 qf ϕ
q2 ϕ q3
q3 q3 qf
*qf ϕ ϕ
The equivalent DFA will be:-
State 0 1
→[q0] [q3] [q1, q2]
[q3] [q3] [qf]
[q1, q2] [qf] [q3]
*[qf] ϕ ϕ

Example 2:-Design a NFA from given regular expression 1 (1* 01* 01*)*.
Solution: The NFA for the given regular expression is as follows:-
Step 1:-
Step 2:-
Step 3:-

Arden’s Theorem
If r=t+r.s with s ǂ λ then r=ts*
Proof:- r=t+r.s
r=t+(t+r.s) s
r=t+ts+rs.s
r=t+ts+(t+rs)ss…………………………………replace by r=t+rs
r=t+ts+tss+rsss…..so no
r=t(∑+s+ss+sss…)
r=ts*
The utility of Arden theorem is that it is used to convert finite

automata in a regular expression.

Arden’s Theorem
Assumptions –
• The transition diagram should not have λ

-moves.
• It must have only one initial state.

Arden’s Theorem
Steps to be performed:-
1. For getting the regular expression for the automata we first create equations
of the given form for all the states
q1 = q1λ11 +q2 λ 21 +…+qn λ n1 + λ (q1 is the initial state)

q2 = q1 λ 12 +q2 λ 22 +…+qn λ n2
.
.
.
qn = q1 λ 1n +q2 λ 2n +…+qn λ nn
2. If { q1,q2….qr} are final states. Than the resulting regular expression

obtained by ∑ of all this state.
It imply R.E= q1+q2+…..+qr

Example on Arden’s Theorem
Question:- Obtain a regular expression corresponding the following

transaction system or finite automata.
a b
a a
q1 q2 q3
b a
Solution:-
q1=q1a+q2b+q3ϕ+λ……………………..(1)
q2=q1a+q2b+q3a………………………...(2)
q3=q1ϕ+q2a+q3 ϕ………………………..(3)

So consider eq. (3)

q3=q2a……………..(A)
Substitute q3 in eq. (2)
q2=q1a+q2b+q2aa => q2=q1a+q2(b+aa)
q2=q1a+q2(b+aa) => r = t + r s
q2=q1a(b+aa)...........(B)
Substitute q2 in eq. (1)

q1=q1a+q2b+λ => q1=q1a+q1a(b+aa)*b+λ
=> q1=q1(a+a(b+aa)*b)+λ
q1=q1(a+a(b+aa)*b)+λ => r = t + r s

q1=(a+a(b+aa)*b)*…………….(C)
Substitute the value of q1 in eq. (B)
q2=(a+a(b+aa)*b)*. a(b+aa)
Substitute the value of q2 in eq. (A)
q3=(a+a(b+aa)*b)*. a(b+aa) . A
R.E.= q3

Question:- Obtain a regular expression corresponding the following

transaction system or finite automata.
a a a,b
q1 q2 q4
b
b b
q3
a
Solution:-
q1=q1ϕ +q2b+q3a+q4ϕ + λ…………………………..(1)

q2=q1a+q2ϕ +q3ϕ+q4ϕ ……………………………...(2)
q3=q1b+q2ϕ +q3ϕ+q4ϕ ……………………………...(3)
q4=q1ϕ +q2a +q3b+q4(a+b) …………………………(4)

From Eq. 2 and 3
q2=q1a & q3=q1b
As q1 is the final stage, so we considered eq. 1
q1=q1ϕ +q2b+q3a+q4ϕ + λ
q1= q2b+q3a + λ…………………………………(A)
Substitute the value of q2 & q3 in eq. (A)
q1=q1ab+q1ba + λ
q1=q1(ab+ba) + λ => r = t + r s
R.E. => q1= (ab+ba)*

State Elimination Method
Step 1:-
Thumb Rule-
The initial state of the DFA must not have any incoming edge
• If there exists any incoming edge to the initial state, then

create a new initial state having no incoming edge to it.

Step 2:-
Thumb Rule-
There must exist only one final state in the DFA
• If there exists multiple final states in the DFA, then convert all
the final states into non-final states and create a new single
final state.

Step 3:-
Thumb Rule-
The final state of the DFA must not have any outgoing edge.
• If there exists any outgoing edge from the final state, then
create a new final state having no outgoing edge from it.

Step 4:-
• Eliminate all the intermediate states one by one.
• These states may be eliminated in any order.
In the end,
• Only an initial state going to the final state will be left.

• The cost of this transition is the required regular expression.

Examples of State Elimination Method
Example:-Find regular expression for the following DFA
Solution:-
• Step 1:- Initial state A has an incoming edge.

• So, we create a new initial state qi.

Step-02:
• Final state B has an outgoing edge.

• So, we create a new final state qf

Step-3
• Start eliminating the intermediate states.
• First, let us eliminate state A.
• There is a path going from state qi to state B via state A.
• So, after eliminating state A, we put a direct path from state
qi to state B having cost ∈.0 = 0
• There is a loop on state B using state A.
• So, after eliminating state A, we put a direct loop on state B
having cost 1.0 = 10.

Step-04:
• Eliminate state B.
• There is a path going from state qi to state qf via state B.
• So, after eliminating state B, we put a direct path from state
qi to state qf having cost 0.(10)*.∈ = 0(10)*
Regular Expression: 0(10)*

DFA, Regular Languages,Regular Expressions
Finite Automata Regular Language Regular

Expression
q0 {Ɛ} RE = Ɛ
a
q0 q1 {} RE = 
a
q0 q1 {a} RE = a
a
b
q0 q1 {a, b} RE = a+b

DFA, Regular Languages,Regular Expressions
Finite Automata Regular Language Regular

Expression
a b
q0 q1 q2 {ab} RE = a.b
a
q0 {Ɛ,a,aa,aaa,……} RE = a*
a
a
q0 q1 {a,aa,aaa,…….} RE = a.a* = a+
a
q0 q1 {Ɛ, ab,abab,…….} RE = (ab)*
b

Regular Expressions, Regular Languages
Regular Expressions Regular Languages

(0 + 10*) L = { 0, 1, 10, 100, 1000, 10000, … }
(0*10*) L = {1, 01, 10, 010, 0010, …}
(0 + ε)(1 + ε) L = {Ɛ, 0, 1, 01}
(a+b)* L = {Ɛ, a, b, aa , ab , bb , ba, aaa…….}
(a+b)*abb L = {abb, aabb, babb, aaabb, ababb, …………..} ending with abb
(11)* L= {Ɛ, 11, 1111, 111111, ……….}
(aa)*(bb)*b Set of strings consisting of even number of a’s followed by odd
number of b’s , so L = {b, aab, aabbb, aabbbbb, aaaab,
aaaabbb, …………..}
(aa + ab + ba + bb)* String of a’s and b’s of even length can be obtained by
concatenating any combination of the strings aa, ab, ba and bb
including null, so L = {Ɛ, aa, ab, ba, bb, aaab, aaba, …………..}

Identities of Regular Expression
I1: R+∅=∅+R=R
I2: R. ∅ = ∅
I3: R.ε = ε.R = R
I4: ε* = ε
I5: R+R=R
I6: R*R* = R*
I7: RR* = R*R
I8: (R*)* = R*
I9: ε + RR* = ε + R*R = R*
I10: (PQ)*P =P(QP)*
I11: (P+Q)* = (P*Q*)* = (P*+Q*)*
I12: PQ+PR = P(Q+R) and QP+RP = (Q+R)P

Arden’s Theorem
Let P and Q be two regular expressions. If P does not contain Ɛ, then
R = Q + RP has a unique solution that is
R = QP* R = Q+RP
Proof = Q + (Q + RP)P
R=Q+RP = Q + QP + RP2
= Q+QP*P = Q + QP + (Q + RP)PP
= Q(Ɛ + P*P) = Q + QP + QP2 + RP3
= QP* =…
So, R = QP* is a solution. =…
= Q + QP + QP2 +_ _ _ _ + QPn + RPn+1
= Q + QP + QP2 +_ _ _ _ + QPn + QP*Pn+1
=Q ( Ɛ+ P + P2 + _ _ _ _ + Pn + P*Pn+1)
=QP*
Hence, R=QP* is a Unique Solution.
DFA to Regular Expression
b
q1 = q0b + q1b + q2b

a
q1 q2 = q0b + q1b + (q1a)b (Substituting value of q2)
b = q0b + q1(b + ab)
b = q0b (b + ab)* (Applying Arden’s Theorem)
a
q0 q0 = q0a + q2a + ε
a = q0a + q1aa + ε (Substituting value of q2)
q0 = q0a + q2a + ε = q0a + q0b(b + ab*)aa + ε (Substituting value of q1)
q1 = q0b + q1b + q2b = q0(a + b(b + ab)*aa) + ε

q2 = q1a = ε (a+ b(b + ab)*aa)*
= (a + b(b + ab)*aa)*
Regular Expression to NFA
Construct an NFA for a*b*c*.

a b c
Ɛ Ɛ
q0 q1 q2

Regular Expression to NFA
Construct an NFA for a(a+b)*b.

Ɛ-NFA a,b
a Ɛ Ɛ b
q0 q1 q2 q3 q4
NFA a,b
a b q4
q0 q2

Regular and Non-regular Languages
• Regular languages are accepted by Finite automata.

• They are generated by Regular grammar.
• Regular language can also be expressed in the form of regular
expression.

Closure Properties of Regular Languages
• Regular languages are closed under:

• Complement
• Concatenation
• Union
• Intersection
• Reverse
• Difference
• Kleene closure
• Homomorphism
• Inverse homomorphism

Complement: If L is a regular language then L’ is also a regular

language.
Proof
Let D(L) = (Q, Σ, δ,q0, F) be a DFA that accepts L.
Then we can construct a DFA D(L’) = (Q, Σ, δ,q0, Q-F) that accepts L’.
Make final state non final and vice-versa.

Concatenation: If L1 and L2 are regular languages then L1.L2 is also a

regular language.
Proof: Construct NFA for L1.L2 as follows:
D(L1) D(L2)
Make it Non-final

Union: If L1 and L2 are regular languages then L1  L2 is also a regular

language.
Proof: Construct NFA for L1  L2 as follows:
D(L1)
D(L2)
Ɛ

Intersection: If L1 and L2 are regular languages then L1  L2 is also a

regular language.
Proof: Using DeMorgan’s law: L1 L 2 = L1 L 2
L1 and L2 are Regular.
L1’ and L2’ are Regular.
L1’  L2’ is Regular.
L1 L 2 is Regular.
L1  L2 is Regular.

Reverse: If L is regular language then LR is also a regular language.

Proof: Construct NFA for LR as follows:
• Reverse all transitions
• Make the initial state final and final state initial.
D(L) D(LR)

Difference: If L1 and L2 are regular languages then L1 - L2 is also

a regular language.
Proof: L1 − L 2 = L1 L 2 = L1 L 2
L1 and L2 are Regular.
L1’ is Regular.
L1 L 2 is Regular.

Kleene Closure: If L is regular language then L* is also a regular language.

Proof: Construct NFA for L* as follows:
D(L)
Ɛ

Homomorphism:
A homomorphism is function h : Σ∗ → ∆∗ defined as follows:
• h(Ɛ) = Ɛ and for a ∈ Σ, h(a) is any string in ∆∗
• For a = a1a2 . . . an ∈ Σ∗ (n ≥ 2), h(a) = h(a1)h(a2). . . h(an).
• A homomorphism h maps a string a ∈ Σ∗ to a string in ∆∗ by mapping each character
of a to a string h(a) ∈ ∆∗
• A homomorphism is a function from strings to strings that “respects” concatenation:
for any x, y ∈ Σ ∗ , h(xy) = h(x)h(y). (Any such function is a homomorphism.)
Example. h : {0, 1} → {a, b}∗ where h(0) = ab and h(1) = ba. Then h(0011) = ababbaba

Homomorphism:
Regular languages are closed under homomorphism, i.e., if L is a regular language and
h is a homomorphism, then h(L) is also regular.
Proof. We will use the representation of regular languages in terms of
regular expressions to argue this.
• Define homomorphism as an operation on regular expressions
• Show that L(h(R)) = h(L(R))
• Let R be such that L = L(R). Let R0 = h(R). Then h(L) = L(R0 ).

Homomorphism:
Regular languages are closed under homomorphism, i.e., if L is a regular language and
h is a homomorphism, then h(L) is also regular.
Proof. We will use the representation of regular languages in terms of
regular expressions to argue this.
• Define homomorphism as an operation on regular expressions
• Show that L(h(R)) = h(L(R))
• Let R be such that L = L(R). Let R0 = h(R). Then h(L) = L(R0 ).

Pumping Lemma for Regular Languages
Objective of the Topic

The objective of the topic is to make the student able to:
• Apply pumping lemma.
• Prove that a language is not regular

• L1 = {ambn, m,n >=0} is a regular language.

• L2 = {anbn, n >=0} is not a regular language.
• L3 = {w|w has an equal number of 0s and 1s} is not a regular language.
• Pumping Lemma is used to prove that a language is not regular.
• It can not be used to prove that a language is regular.
Pumping Lemma
• If L is a Regular Language, then there is a number m (the pumping
length) where if w is any string in L of length at least m, then w may be
divided into 3 pieces, w = xyz, satisfying the following conditions:
a. xyiz ∈ L, For each i ≥ 0
b. |y| > 0, and
c. |xy| ≤ m.

Process to use Pumping lemma
• Assume that L is regular.

• So, the pumping lemma should hold for L.
• Use the pumping lemma to obtain a contradiction
– Select w such that |w| ≥ m
– Divide w into x, y and z
• Select y such that |y| ≥ 1
• Select x such that |xy| ≤ m
• Assign the remaining string to z.
– Pump y such that xyiz  L.
• By contradiction say L is not regular.

Prove that L = {anbn | n ≥ 0} is not regular.
Solution −
Assume that L is regular and m is the number of states.
Let w = ambm. Thus |w| = 2m ≥ m.
By pumping lemma, let w = xyz, where |xy| ≤ m.
Let x = ap, y = aq, and z = arbm, where p + q + r = m, p ≠ 0, q ≠ 0, r ≠ 0. Thus |y| ≠ 0.
Let k = 2. Then xy2z = apa2qarbm.
Number of as = (p + 2q + r) = (p + q + r) + q = m + q
Hence, xy2z = am+q bm. Since q ≠ 0, xy2z is not of the form anbn.
Thus, xy2z is not in L. Hence L is not regular.

Decision Properties of Regular Languages
Following properties are decidable for Finite Automata.

• Emptiness
To determine whether FA accepts any language or not?
• Finiteness
To determine whether Language accepted by FA is finite or infinite?
• Membership
To determine whether string w is accepted by FA or not?
• Equality
To determine whether two FA are accepting same language.

Emptiness:
Step-1: Remove unreachable states.
Step 2: If the resulting machine contains at least one final states,
then the finite automata accepts language.
Step 3: if there is no final state, then finite automata accepts
empty language.
Finiteness:
Step-1: Remove unreachable states.
Step-2: Remove dead states.
Step-3: If the resulting machine contains loops or cycles then the
FA accepts infinite language.
Step-4: If the resulting machine do not contain loops or cycles then
the FA accepts finite language.

Membership:
Let M is a finite automata that accepts some strings over an
alphabet, and let ‘w’ be any string defined over the alphabet, if
there exist a transition path in M, which starts at initial state & ends
in anyone of the final state, then string ‘w’ is a member of M,
otherwise ‘w’ is not a member of M.
Equality:
Two finite state automata M1 & M2 is said to be equal if and only if,
they accept the same language.
Minimise the finite state automata and the minimal DFA will be
unique.

Limitations of FA
• FA can not be constructed for

➢ Context Free Grammar
➢ Context sensitive Grammar
➢ Recursive Enumerable Grammar
• Calculation can not be done with FA.
• There is no storage in FA.
• FA can not modify the input (as Turing Machine does).

Video Links
My Video Channel:
https://www.youtube.com/playlist?list=PLKhyqvN-JcP5AF4UzRz9wxFVBm63igm7y
• NPTEL Video Links

https://youtu.be/vQeROGcwQs4
https://youtu.be/XxuH_K-wzpg
https://youtu.be/C7LqbEunJ1Y

Daily Quiz
1. If L1 and L2 are regular languages is/are also regular language(s).

a) L1 + L2
b) L1L2
c) L1’
d) All of above
2. Every regular expression can be expressed as CFG but every CFG

cannot be expressed as a regular expression. this statement is :
a) True
b) False
c) depends on language
d) None of the option

Daily Quiz
3. In pumping Lemma, If we select a string w such that w∈L, and

w=xyz. Which of the following portions cannot be an empty string?
A. x
B. y
C. z
D. all of the mentioned
4.The total number of states required to automate the given regular

expression(00)*(11)*
A. 3
B. 5
C. 6
D. 2

Daily Quiz
5. Moore machine produce the output string of length ----------

corresponding to n length input string
A. n
B. n+1
C. n-1
D. 2n
6. Which of the following does not represents the given language over
{a,b} ?
A. a+ab
B. {a} U {ab}
C. {a} U {a}{b}
D. {a} ^ {ab}

Daily Quiz
7. The given NFA corresponds to which of the following Regular

expressions?
A. (0+1) *(00+11) (0+1) +

B. (0+1) *(00+11) *(0+1) *
C. (0+1) *(00+11) (0+1)
D. (0+1) (00+11) (0+1) *

Daily Quiz
8. Regular grammar is
a) context free grammar
b) non context free grammar
c) English grammar
d) none of the mentioned
9. Which of the following is true?
a) Every subset of a regular set is regular
b) Every finite subset of non-regular set is regular
c) The union of two non regular set is not regular
d) Infinite union of finite set is regular
10. Regular expressions are closed under
a) Union
b) Intersection
c) Kleen star
d) All of the mentioned

Weekly Assignment
1. Find a regular expression corresponding to each of the following

subsets of {a. b}. [CO2]
• The set of all strings containing exactly 2a’s.
• The set of all strings containing at least 2a’s.
• The set of all strings containing at most 2a's.
• The set of a]] strings containing the substring aa.
2. Find the sets represented by the following regular expressions.
[CO2]
• (a + b)*(aa + bb + ab + ba)*
• (aa)* + (aaa)*
• (1 + 01 + 001)*(∊+ 0 + 00)
• a + b(a + b)*

Weekly Assignment
3. Prove the identity: (a*ab + ba)*a* = (a + ab + ba)*

[CO2]
4. State Pumping Lemma for Non-Regular languages. Prove that
the language L= (aq where q is a prime number} is a Non
regular language. [CO2]
5. Show that L = {aibjck| k>i+j} is not regular.
[CO2]
6. Find the regular expression corresponding to the automaton
given in Fig.

Weekly Assignment
7. State and prove Arden’s theorem. Give a regular expression

for the Finite Automaton M=[{A ,B, C, D}, {a, b}, δ, A, {A}]
where δ is given below: [CO2]
– δ (A, a) = B δ (A, b) = C
– δ (B, a) = D δ (B, b) = A
– δ (C, a} = A δ (C, b) = D
– δ (D, a) = D δ (D, b) = D
8. Explain the Chomsky hierarchy of formal languages. Define

the relationship between languages and corresponding
machine. [CO2]

Weekly Assignment
9. Design a Mealy Machine which reads input from {0, 1} and

outputs are EVEN or ODD according to total number of 1’s are
even or odd. Also convert that Mealy Machine into
Corresponding Moore Machine.
[CO2]
10.Construct a finite automaton recognizing L(G), where G is the
grammar S →a S | bA| b and A →aA| bS| a.
[CO2]

MCQ s
Which of the following are decision properties?

A. Emptiness
B. Infiniteness
C. Membership
D. All of the mentioned
In pumping lemma theorem (x y^n z) the range of n is

A. n=1, 2, 3, 4……….
B. n=0, 1, 2, 3, 4……….
C. n=…….-3,-2,-1, 0, 1, 2, 3, 4……
D. n=…….-3,-2,-1, 1, 2, 3, 4……

MCQ s
Let S and T be language over ={a,b} represented by the regular

expressions (a+b*)* and (a+b)*, respectively. Which of the following
is true?
A. S is a subset of T
B. T is a subset of S
C. S=T
D. S intersection T=Ø
The logic of pumping lemma is good example of

A. the pigeon hole principle
B. divide and conquer
C. recursion
D. iteration

MCQ s
Let a Grammar G is defined by the production S→aS | bS , then

language generated by Grammar is defined as
A. Φ
B. ∊
C. {a,b}*
D. {a,b}+
Which of the following is true?

A. (01)*0 = 00(10)*
B. (0+1)*0(0+1)*1(0+1) = (0+1)*01(0+1)*
C. (0+1)*01(00+1)*+1*0* = (0+1)*
D. All of the mentioned

MCQ s
Which among the following looks similar to the given expression?

((0+1). (0+1))*
A. {xϵ {0,1} *|x is all binary number with even length}
B. {xϵ {0,1} |x is all binary number with even length}
C. {xϵ {0,1} *|x is all binary number with odd length}
D. {xϵ {0,1} |x is all binary number with odd length}
Which of the following represents a language which has no pair of

consecutive 1’s if ∑= {0,1}?
A. (0+10)*(1+ε)
B. (0+10)*(1+ε)*
C. (0+101)*(0+ε)
D. (1+010)*(1+ε)

Old Question Papers
• https://drive.google.com/drive/folders/19Eia3VHCl3
627foiH6V_j-p4X9ZkyyC7?usp=sharing

Expected Questions for University Exam
1.Find regular expression over ∑={a,b} for all strings containing either
the sub string ‘aaa’ or ‘bbb’.
2.Write regular expression for set of all strings such that number of a’s
divisible by 3 over Σ = {a,b}.
3.State the pumping lemma theorem for regular languages.
4.Convert the FA given below to left linear grammar.
5.Show that L = {ai bj ck | k > i + j} is not regular.

Expected Questions for University Exam
6. Find the regular expression for the given FA.
7. For the two regular expressions :

r1 = a* + b* r2 = ab* + ba* + b*a + (a*b)*
a. Find a string corresponding to r2 but not to r1 and
b. Find a string corresponds to both r1 and r2.

Summary
• Regular expressions are used for regular languages.

• Using Arden’s theorem a FA is converted into regular expression.
• Regular expression is converted into Ɛ-NFA.
• Pumping lemma is used to prove that a language is not regular.
• Regular languages are closed under union, intersection,
complement, reverse, concatenation and kleene closure.

References
• Hopcroft, J. E., Motwani, R., & Ullman, J. D. (2001). Introduction to

automata theory, languages, and computation. Acm Sigact News, 32(1),
60-65.
• Linz, P. (2006). An introduction to formal languages and automata. Jones &
Bartlett Learning.
• Mishra, K. L. P., & Chandrasekaran, N. (2006). Theory of Computer Science:
Automata, Languages and Computation. PHI Learning Pvt. Ltd..


Toafl PPT Unit2

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Toafl PPT Unit2

Uploaded by

Copyright:

Available Formats

Theory of Automata and Formal Languages

Regular Expressions and Languages

6/9/2022 VANDANA KCS-402 (TOAFL) Unit II 1

6/9/2022 VANDANA KCS-402 (TOAFL) Unit II 2

Regular Expressions and Languages: Regular Expressions, Transition

6/9/2022 VANDANA KCS-402 (TOAFL) Unit II 3

Objective of the course is to make students able to:

6/9/2022 VANDANA KCS-402 (TOAFL) Unit II 4

• We have already discussed that languages accepted by Finite

6/9/2022 VANDANA KCS-402 (TOAFL) Unit II 5

Regular Expression is a notation for specifying patterns.

Rules for Regular Expression:-

1. Ɛ is a regular expression that denotes language {Ɛ}, set containing the

6/9/2022 Ms. Vandana KCS-502 Unit 2 6

6/9/2022 VANDANA KCS-402 (TOAFL) Unit II 7

6/9/2022 Ms. Vandana KCS-502 Unit 2 8

Case 1 − For a regular expression ‘a’, we can construct the following FA −

Case 2 − For a regular expression ‘ab’, we can construct the following FA −

6/9/2022 Ms. Vandana KCS-502 CD Unit 1 9

Case 4 − For a regular expression (a+b)*, we can construct the following FA −

6/9/2022 Ms. Vandana KCS-502 CD Unit 1 11

6/9/2022 Ms. Vandana KCS-502 CD Unit 1 12

The equivalent DFA will be:-

6/9/2022 Ms. Vandana KCS-502 CD Unit 1 14

Solution: The NFA for the given regular expression is as follows:-

6/9/2022 Ms. Vandana KCS-502 CD Unit 1 15

If r=t+r.s with s ǂ λ then r=ts*

The utility of Arden theorem is that it is used to convert finite

6/9/2022 Ms. Vandana KCS-502 CD Unit 1 16

• The transition diagram should not have λ

• It must have only one initial state.

6/9/2022 Ms. Vandana KCS-502 CD Unit 1 17

q1 = q1λ11 +q2 λ 21 +…+qn λ n1 + λ (q1 is the initial state)

2. If { q1,q2….qr} are final states. Than the resulting regular expression

It imply R.E= q1+q2+…..+qr

6/9/2022 Ms. Vandana KCS-502 CD Unit 1 18

Question:- Obtain a regular expression corresponding the following

6/9/2022 Ms. Vandana KCS-502 CD Unit 1 19

So consider eq. (3)

Substitute q2 in eq. (1)

6/9/2022 Ms. Vandana KCS-502 CD Unit 1 20

Substitute the value of q1 in eq. (B)

Substitute the value of q2 in eq. (A)

6/9/2022 Ms. Vandana KCS-502 CD Unit 1 21

Question:- Obtain a regular expression corresponding the following

q1=q1ϕ +q2b+q3a+q4ϕ + λ…………………………..(1)

6/9/2022 Ms. Vandana KCS-502 CD Unit 1 22

As q1 is the final stage, so we considered eq. 1

Substitute the value of q2 & q3 in eq. (A)

R.E. => q1= (ab+ba)*

6/9/2022 Ms. Vandana KCS-502 CD Unit 1 23

• If there exists any incoming edge to the initial state, then

6/9/2022 Ms. Vandana KCS-502 CD Unit 1 24

6/9/2022 Ms. Vandana KCS-502 CD Unit 1 25

6/9/2022 Ms. Vandana KCS-502 CD Unit 1 26

• Only an initial state going to the final state will be left.

6/9/2022 Ms. Vandana KCS-502 CD Unit 1 27

Example:-Find regular expression for the following DFA

• Step 1:- Initial state A has an incoming edge.

6/9/2022 Ms. Vandana KCS-502 CD Unit 1 28

• Final state B has an outgoing edge.

6/9/2022 Ms. Vandana KCS-502 CD Unit 1 29

6/9/2022 Ms. Vandana KCS-502 CD Unit 1 30

Construct an NFA for abc*.

3. Prove the identity: (aab + ba)a* = (a + ab + ba)*