Scribd
Upload
10 views2 pages

21cs51 Assignment 1

The document outlines various assignments related to automata theory and compiler design, including the design of DFAs for specific patterns of strings, conversion of NFAs to DFAs, and proofs related to regular expressions and the pumping theorem. It also includes tasks for constructing e-NFAs and obtaining regular expressions through state elimination. Additionally, it addresses the properties of certain languages and includes a DFA with tasks for analyzing its distinguishability and minimizing its states.

Uploaded by

pushyagowda38
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
10 views2 pages

21cs51 Assignment 1

The document outlines various assignments related to automata theory and compiler design, including the design of DFAs for specific patterns of strings, conversion of NFAs to DFAs, and proofs related to regular expressions and the pumping theorem. It also includes tasks for constructing e-NFAs and obtaining regular expressions through state elimination. Additionally, it addresses the properties of certain languages and includes a DFA with tasks for analyzing its distinguishability and minimizing its states.

Uploaded by

pushyagowda38
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

AUTOMATA THEORY AND COMPILER DESIGN

ASSIGNMENT-1
1) Design a DFA which accepts any no of a’s followed by a string ba followed by a string a’s
and b’s [a*ba (a+b)*]?
2) Obtain a DFA to accept strings of 0’s, 1’s, and 2’s beginning with a one followed by odd
no of 0’s and ending with 2?
3) Obtain a DFA to accept strings starting with 2 0’s and ending with at least 2 1’s?
4) Obtain a DFA to accept a strings of a’s and b’s with at most two consecutive b’s
[abababb]?
5) Construct a DFA to accept the strings over {a,b} that every block length of 5 contains at
least 2 a’s?
6) Convert the following NFA to its equivalent DFA.

0 1
0,1
7 ,1 Q1 Q2
Q0
1.

7) Convert the given  –NFA to its equivalent DFA .


where state 0 is the starting state &state 9 is the final state.

a 
a b   4 5 
9
0 1 2 E 3 8
b
 6  7 

8) a) Prove that for every regular expression there is an equivalent Finite automaton
b)Construct an e-NFA hat accepts the following languages
i) (a+b) * (ab)
ii)(0+1)* 1 (0+1)
9) .Obtain regular expressions by elimination of states from DFA.

0 0

1
B
A
A
1
1

10) a)State and prove pumping theorem


b)Prove the following languages are not regular
i) L= {w: (na (w)> nb (w))
ii)L={w=anbn n>0}
iii)prime numbers are non regular.

11) Consider the 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
i) Draw the table of distinguishabilites for the DFA
ii) Construct the minimum state equivalent DFA.

You might also like