Scribd
Upload
8 views4 pages

Assignment - 1

Uploaded by

Scooby Dobby
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
8 views4 pages

Assignment - 1

Uploaded by

Scooby Dobby
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/ 4

Assignment -1 (Mapped with CO2, CO3)

Set –A
S. no Question Marks COs BT
Level
1. Construct DFA to accept the following languages over alphabet {0, 1} 5 Marks CO3 Level
5
a. The language of all strings containing at least three 1’s.
b. The language of all strings that do not end with 11.

2. Consider the following NDFA/NFA whose transition table is given and design 5 marks CO2 Level
DFA. Q= {q0, q1, q2, q3}, ∑={a,b}. Here q0 is the initial state and q3 is the 6
final state.

Explain the procedure step by step.

Set –B
S. no Question Marks COs BT
Level
1. 5 CO2 Level 5
a. Consider the transition diagram given below & convert given NFA-ε to mark
NFA s
2. Consider the following automation and evaluate the regular expression using 5 marks CO3 Level 4
Arden’s theorem.

Explain the procedure step by step.

SET-C
S. no Question Marks COs BT
Level
1. 5 CO3 Level 5
Define Regular Language. Design a Finite Automata from the given RE mark
[ ab + (b + aa)b* a ]. s

2. Consider the two Deterministic Finite Automata (DFA) and check 5 marks CO2 Level 4
whether they are equivalent or not.
.

You might also like