0% found this document useful (0 votes)
22 views1 page

CO311 ATFL Assignment Test 1

Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
22 views1 page

CO311 ATFL Assignment Test 1

Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

RVR & JC College of Engineering

(Autonomous, NAAC – ‘A’ Grade) Chowdavaram, Guntur – 52019


Dept. of Computer Science & Engineering(IoT)
III/IV B.Tech CSO CO311–Automata Theory and Formal Languages
2023-24 (5th Semester) Assignment Test– I Max. Marks: 12

Time: 45 min Assignment Test – I Max. Marks: 12


1. a. Define the terms alphabet, string, and language. 3M
b. Discuss Finite State Machine with the help of a block diagram and its applications. 3M
2. a. What is Deterministic Finite Automata discuss with suitable example. 3M
b. Draw the DFA for the language L={w|w has even number of 0’s and odd number of 1’s}. 3M
3. a. Compare DFA and NFA. 2M
b. Write the procedure for converting NFA to DFA and Convert the following NFA to DFA. 4M
0 1 2
→q0 {q1, q4} {q4} {q2, q3}
q1 Ø {q4} Ø
q2 Ø Ø {q2, q3}
q3* Ø {q4} Ø
q4 Ø Ø Ø
4. a. Discuss NFA with ϵ - movies with suitable example. 3M
b. Find ϵ-closures of each state and Eliminate ϵ-Transitions from the following. 3M

5. Discuss the pumping lemma theorem and its applications for Regular languages. 6M
6. a. L = {ak | k is a prime number} P.T L is not regular 3M
b. L = {anb2n } P.T L is not regular 3M

C++ code to overload (), [], ->, and comma (,) operators 6M

1
Dr.NNMR

You might also like