Scribd
Upload
7 views3 pages

TAFL Assignment 1

This document outlines an assignment for the Theory of Automata and Formal Languages course for the CSE department, detailing questions related to finite automata, DFA construction, and machine types. The assignment is due on 10-03-2025 and consists of various tasks that require students to demonstrate their understanding of automata theory concepts. Each question is linked to specific course outcomes and Bloom's taxonomy levels.

Uploaded by

abhix1201
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
7 views3 pages

TAFL Assignment 1

This document outlines an assignment for the Theory of Automata and Formal Languages course for the CSE department, detailing questions related to finite automata, DFA construction, and machine types. The assignment is due on 10-03-2025 and consists of various tasks that require students to demonstrate their understanding of automata theory concepts. Each question is linked to specific course outcomes and Bloom's taxonomy levels.

Uploaded by

abhix1201
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

Department of CSE Even Sem

Theory of Automata and Formal SESSION: 2024-25


Languages (BCSE0404)
UNIT-I &II
Semester/Section:
CSE, IV
Assignment Given Date: Assignment Submission Date: 10-03-2025
Faculty Name: Maximum Marks: 50

Note: Write answer of each question in clear handwriting. Assignment has to be submitted
on teams and hard copy as well. Name and roll no. should be written on each page.

Q.N. Question Statement CO BLOOM’S


KNOWLE
DGE
LEVEL
1. Q1. Give the finite automata accepting the following language over
alphabet {0, 1}.
(a) The set of all strings containing atmost one “0” and at most one
“1”.
(b) The set of all strings whose first and last symbols differ. CO1 K5,K6
(c) The set of strings not containing three consecutive zeros.
(d) L = {w: (w) mod 3 }
(e) The set of strings in which total number of 0’s is divisible by 3.
(f) L = {w: (w) mod 3 = 1 and (w) mod 2 = 0}
(g) The set of strings which neither contains consecutive 0’s nor
consecutive 1’s.
(h) The set of strings whose 2nd bit is 1.
(i) L= {w: |w| mod 5 ≠ 0}.
2 Q2. Construct DFA accepting each of the following language: - CO1 K5, K6
(a) L = {w є {a, b} * / w has an odd number of a’s or even number of
b’s.}
(b) L = {w є {a, b} * / w has neither aa nor bb as substring}
(c) L = {w є {a, b} * / w has both ab and ba as substring}

3 Q3. Construct DFA equivalent to NFA. where transition function,  is CO1 K6


defined in the
following Table I. Here, A is the initial state.
4 Q5. Consider the following transition diagram. CO1 K4, K5

Test whether the string 110101 is accepted by the Finite automata


represented by the above transition diagram. Show the entire sequence
of states traversed.
5 Compute the epsilon- closure for the given NFA. Convert it into DFA. CO1 K4, K5

6 Describe Mealy and Moore machines with example. Convert the CO1 K3, K4, K6
given Mealy machine into Moore machine.

CO1 K3, K4, K6


7 Construct a Mealy and Moore machine that determines whether an
input string contains an even or odd number of 1's. The machine
should give 1 as output if an even number of 1's are in the string and 0
otherwise
8 Draw a diagram to show Chomsky classification with types of CO1 K2, K3
grammar used.
C02 K2, K3, K4, K6
9 State the applications of FA, PDA, LBA, TM.

10 Discuss Kleen Closure with suitable example. C02 K2

You might also like