CANARA ENGINEERING COLLEGE

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

5 SEMESTER B SECTION B.E. DEGREE ACADEMIC YEAR 2019-20
Course Title AUTOMATA THEORY AND COMPUTABILITY
Course Code 17CS54

Assignment Announcement Date:28-10-2019

Assignment Submission Deadline:18-11-2019 Max. Marks: 10
Assignment

1.(a) What is automata ? Discuss why study automata

(b) Mention the differences between DFA,NFA and NFA-€
(c) Design a DFA to accept the language L=(W/W is of even length and begins with 01)
(d) Design the NFA-e or NFA for the language given below
i) abc,abd and aacd {Assume ∑ = a,b,c,d}
ii) {ab,abc}* {Assume ∑=a,b,c}

2. (a) Convert the following Nfa-€ to DFA using? Subset construction scheme?

(b) Define Regular expression and write regular expression for the following languages
i)L={a^2nb^2m n>=0,m>=0}
ii) Language over {0,1} having all strings not containing 00.
(c) Convert the regular expression (0+1)*1(0+1) to NFA-€

3(a) state and prove pumping Lema theorm for regular languages.Show that L={a^n
b^n|n>=0} is not regular
(c) Consider the transitition table of DFA given below :
(ii) Construct the equivalent minimized DFA
4
(a) Obtain a grammer to generate integers and write derivation for the unsigned integer 1965
(b) Consider the grammar:
S->aS|aSbS|€
Is the above grammar ambiguous? Show that the string aab has
two
i)Parse Trees
ii) Left most derivation
iii) Right most derivation
5
(a) Define PDA Design PDA to accept the language L(M)={wcw^r |w€(a+b)*} by a final
state and also give the graphical representation of PDA.
6
(a) Consider the following grammar :
S->ASB|€
A->aAS|a B-
>SbS|A|bb
i)Are there any useless symbol?Eliminate if
so. ii)Eliminate € productions.
iii)Eliminate unit productions.
iv)Put the grammar into Chomsky Normal Form.
(b) Show that L={a^nb^nc^n|n>=0} is not Context free.
(c) Prove that the Context free languages closed under union,concatenation and reversal.

7
(a)Design a Turing machine that perform the following function:
q0w|-qf ww for any w€{1}* and also write its transition diagram.
(b)Explain general structure of multitape and non deterministic Turing machines.

8 write short note on:

(a)Application of regular expressions.
(b)Application of context free Grammars.
(c)Post’s correspondence problem.
(d)Chomsky hierarchy.

______________________
Faculty In-charge
 CANARA ENGINEERING COLLEGE
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING
5 SEMESTER B SECTION B.E. DEGREE ACADEMIC YEAR 2019-20
Course Title AUTOMATA THEORY AND COMPUTABILITY
Course Code 17CS54

Assignment Announcement Date:28-10-2019

Assignment Submission Deadline:18-11-2019 Max. Marks: 10
Assignment Evaluation Rubrics

Excellent Satisfactory Poor

100% 50% 00%

(2 Marks) (1 Marks) (0 Marks)
Material sufficient for Material sufficient for Material is not clear
Neatness (2M) clear understanding and understanding and and not clearly
exceptionally written written written

Submits assignment well Submits assignment Submits assignment

On time
before Submission on next day of on after next day of
submission(2M)
Deadline Submission Deadline Submission Deadline

Methodology followed is Methodology Methodology

Methodology to clear and applied followed and applied followed will not lead
solve each problem exceptionally in solving in solving problem to solution for given
(2M)
the problem problem

Detailed Steps to in Intermediate steps are Intermediate steps

Missing Intermediate
solving the clear and exceptionally are there and
results
problems(2M) written written

Intermediate and
Correct answer Intermediate and final Intermediate or final
final answers are not
generation(2M) answers are correct answers are correct
correct

Faculty In-charge