Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
18 views1 page

First Assignment Automata

The document is an assignment for the Computer Science Engineering Department at Axis Institute of Technology & Management for the course 'Theory of Automata & Formal Language' for the 2024-25 session. It includes various questions related to designing Deterministic Finite Automata (DFA) and Non-deterministic Finite Automata (NFA), as well as analyzing and applying concepts related to formal languages. The assignment covers topics such as string patterns, language acceptance criteria, and the differences between NFA and DFA.

Uploaded by

Shraddha
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
18 views1 page

First Assignment Automata

The document is an assignment for the Computer Science Engineering Department at Axis Institute of Technology & Management for the course 'Theory of Automata & Formal Language' for the 2024-25 session. It includes various questions related to designing Deterministic Finite Automata (DFA) and Non-deterministic Finite Automata (NFA), as well as analyzing and applying concepts related to formal languages. The assignment covers topics such as string patterns, language acceptance criteria, and the differences between NFA and DFA.

Uploaded by

Shraddha
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

Axis Institute of Technology & Management, w.e.

f: Jan 2020
Form No. Acad-
Kanpur 006A

Computer Science Engineering Department

Session: 2024-25 Semester:4th Section: E


Course Code: BCS402 Course Name: Theory of Automata & Formal
Language

Assignment 1

Course
Outcome Title of Questions
Questio
No. , Blooms
n No
Level

Draw DFA for the following language over {0, 1}:


i. Design a finite automata which accepts the language L= {w|
CO1, w has both an even number of 0’s and an even number of
1 1’s ∑= {0, 1}.}
Analyze
ii Design a finite automata which accepts the language L= {w|
w has both an odd number of 0’s and an odd number of 1’s
∑={0,1}.}
Draw DFA for the following language over {a, b}:
i. All strings with abb as a sub string.
2 CO1, ii. The set all strings with three consecutive a’s.
Apply iii. All strings of length at most five b’s.
iv. All strings of length at exactly 5.
v. All strings of length at least five a’s.
i. Design a NFA to recognize the following set of string
0111,100 and 110. Assume the alphabet is {0, 1}.
3 CO1, Hence obtain the equivalent Deterministic Finite
Apply Automata DFA.
ii. Differentiate NFA and DFA? Also write all the tuple
of NFA.
Construct a DFA for the following language over the set ∑=
{a,b}:
CO1, I. {anbm | m is divisible by 2 and n is divisible
4 by 4}.
Analyze
II. L= {W | |W| mod3 = 0}.
III. Construct a DFA which accept three
consecutive 0’s, ∑= {0, 1}.
i. Write the procedure to convert NFA to DFA.
CO1, ii. Write the difference between Moore machine and Mealy
5 machine?
Apply
iii. Design a DFA which accepts strings with end up in either
00 or 11.

You might also like