Scribd
Upload
2 views3 pages

TOC Assignment1

The document outlines a set of assignments involving the construction of Deterministic Finite Automata (DFA) and the conversion of Non-deterministic Finite Automata (NFA) to DFA. It includes specific tasks such as designing DFAs for languages defined over the alphabet {0, 1} and finding regular expressions using Arden’s theorem. Each set of questions is categorized by marks, course outcomes, and Bloom's taxonomy levels.

Uploaded by

virbhadra255
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
2 views3 pages

TOC Assignment1

The document outlines a set of assignments involving the construction of Deterministic Finite Automata (DFA) and the conversion of Non-deterministic Finite Automata (NFA) to DFA. It includes specific tasks such as designing DFAs for languages defined over the alphabet {0, 1} and finding regular expressions using Arden’s theorem. Each set of questions is categorized by marks, course outcomes, and Bloom's taxonomy levels.

Uploaded by

virbhadra255
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/ 3

Set –A

S. no Question Marks COs BT Level


1. Construct DFA to accept the following languages over alphabet {0, 1} 2.5 CO4 Level 5
marks

Each
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 CO5 Level 6
DFA.

Q= {q0, q1, q2, q3}, ∑={a,b}. Here q0 is the initial state and q3 is the final state.

Explain the procedure step by step.

Assignment 1
Set –B
S. no Question Marks COs BT Level
1. Construct DFA to accept the following languages over alphabet {0, 1} 2.5 CO4 Level 5
marks
a. The language of all strings containing even number of 1’s.
Each
b. The language of all strings containing number of 1’s divisible by 4.

2. Consider the following automation and find the regular expression using Arden’s 5 marks CO5 Level 6
theorem.

Explain the procedure step by step.


Set –C
S. no Question Marks COs BT Level
1. 1. Construct DFA to accept the following languages over alphabet {0, 1} 2.5 CO4 Level 5
marks
a. The language of all strings of length two.
Each
b. The language of all strings beginning with 1 and not having two consecutive
0’s.
2. Consider the following NFA and construct equivalent DFA. 5 marks CO5 Level 6

You might also like