Scribd
Upload
27 views2 pages

Tutorial - Minimization of DFA States

Great source for practice

Uploaded by

lahari47279
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
27 views2 pages

Tutorial - Minimization of DFA States

Great source for practice

Uploaded by

lahari47279
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

RV COLLEGE OF ENGINEERING

Autonomous Institution affiliated to VTU


V Semester
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
THEORY OF COMPUTATION (21CS54)
Tutorial-

1. Minimize the states of following DFA.

δ 0 1
A B A
B A C
C D B
*D D A
E D F
F G E
G F G
H G D
Ans: A≡G, B≡F, C≡E.

Reference 1: Page no 194 to 197

2. Minimize the states of following DFA.

δ 0 1
A B E
B C F
*C D H
D E H
E F I
*F G B
G H B
H I C
*I A E
Ans: A≡D≡G, B≡E≡H, C≡F≡I.

Reference 1: Page no 197 to 200

3. Write the regular expressions for the following languages


(i) Strings of a’s and b’s of even length

Ans: RE is ((a+b)(a+b))*

(ii) Strings of a’s and b’s of length <=3

Ans: RE is (Ɛ+a+b)3

(iii) Strings of a’s and b’s having no two consecutive zeros.

Ans: RE is (1+01)*(Ɛ+0+1*)

Tutorial-1 21.1.15 Page 1


(iv) Strings of a’s and b’s whose second symbol from left is a.

Ans: RE is (a+b) a (a+b)*

(v) Strings of a’s and b’s whose second symbol from right is a.

Ans: RE is (a+b)* a (a+b)

(vi) Strings of a’s and b’s whose length is either even or multiples of 3 or both.

Ans: RE is ((a+b)(a+b))* + ((a+b) (a+b) (a+b))*

(vii) Strings of a’s and b’s of the form anbm : m+n is even

Ans: RE is (aa)*(bb)* + a (aa)* b (bb)*

(viii) Strings of a’s and b’s containing not more than three a’s.

Ans: RE is b*(Ɛ+a) b*(Ɛ+a) b*(Ɛ+a)b*

(ix) Strings of a’s and b’s of the form anbm : n≥4, m≤3

Ans: RE is aaaa(a)*(Ɛ+b) (Ɛ+b) (Ɛ+b)

(x) Strings of a’s and b’s with na(w) mod 3 = 0

Ans: RE is (b*ab*ab*ab*)

Reference 1: Finite Automata and Formal Languages by A.M. Padma Reddy

Tutorial-1 21.1.15 Page 2

You might also like