Scribd
Upload
14 views3 pages

TAFL Assignment

The document outlines an assignment for the Theory of Automata and Formal Languages course, detailing questions related to finite automata, DFA construction, NFA conversion, and machine types. It specifies submission guidelines, including the need for clear handwriting and identification on each page. The assignment is due on March 10, 2025, and consists of various tasks aimed at assessing knowledge in automata theory.

Uploaded by

park.aera0901
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
14 views3 pages

TAFL Assignment

The document outlines an assignment for the Theory of Automata and Formal Languages course, detailing questions related to finite automata, DFA construction, NFA conversion, and machine types. It specifies submission guidelines, including the need for clear handwriting and identification on each page. The assignment is due on March 10, 2025, and consists of various tasks aimed at assessing knowledge in automata theory.

Uploaded by

park.aera0901
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
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. Give the finite automata accepting the following language over
alphabet {0, 1}.

(a) The set of all strings containing at most one “0” and at most one
“1”. CO1 K4
(b) The set of all strings whose first and last symbols differ.
(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 Construct DFA accepting each of the following language: - CO1 K4

(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 Construct DFA equivalent to NFA. where transition function,  is CO1 K4


defined in the following Table I. Here, A is the initial state.
Minimize the constructed DFA.
4 Consider the following transition diagram. CO1 K4

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 NFA CO1 K4, K5
and DFA.

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

CO1 K3, K4
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
9 State the applications and limitations of Finite Automata.

10 Discuss Kleen Closure with suitable example. C02 K2

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy