Scribd
Upload
2 views

DBMS MID-1

This document is an assignment examination for the Department of Computer Science and Engineering at Bapatla Women’s Engineering College. It includes various tasks related to finite automata, such as constructing DFAs and NFAs for specific languages and regular expressions. The exam is intended for third-year CSE-B students and is dated March 4, 2025.

Uploaded by

anithameruga_3272953
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 views

DBMS MID-1

This document is an assignment examination for the Department of Computer Science and Engineering at Bapatla Women’s Engineering College. It includes various tasks related to finite automata, such as constructing DFAs and NFAs for specific languages and regular expressions. The exam is intended for third-year CSE-B students and is dated March 4, 2025.

Uploaded by

anithameruga_3272953
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

BAPATLA WOMEN’S ENGINEERING COLLEGE

BAPATLA-522101, Guntur (Dt), A.P.


(Sponsored by Bapatla Education Society)
Approved by AICTE-New Delhi, Affiliated to Acharya Nagarjuna University
An ISO 9001:2015 Certified Institution

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING (AI&ML)


ASSIGNMENT-1 EXAMINATION
SUBJECT/CODE: ACD/CSE311(R-22) DATE: 04-03-2025
CLASS: III CSE-B MARKS: 10 M
1. Draw a DFA for the language accepting strings starting with '00' or '11' over input alphabets
Σ = {0, 1}?
2. Construct the Finite Automata (NFA-ε) for given regular expression (0+1) * 00(0 +1) *.
3. Construct a NFA with € equivalent to the regular expression: 10+ (0+11)0*1
4. Construct a DFA to accept set of all strings ending with 0101.
5. What is a regular expression? Construct finite automata for the regular expression
(0+1)*(00+11)(0+1)*. b) Distinguish between NFA and DFA with examples.
6. Construct the NFA for following Regular expression (0+1)*(01+110).
7. Implement the NFA equivalent to regular expression r = (a+b)* ab.
8. The set of all strings over {0, 1} having even number of 0's and odd number of 1's.
9. Construct DFA for L= {w|w is in the form of 'x01y' for some strings x and y consisting of 0's
and 1's}.
10. Design a DFA, M that accepts the language. L(M)= {w[w∈ {a, b} * } and w does not contain 4
consecutive b's.
11. For the following NFA with ∈ - moves convert it into an NFA without e - moves and show
that NFA with e - moves accepts the same language as shown in figure.

11.

You might also like