Scribd
Upload
4 views5 pages

TAFL Assignment-1

The document outlines an assignment for the Theory of Automata & Formal Languages course for B.TECH CSE students, detailing various tasks related to Non Deterministic Finite Automata (NFA) and Deterministic Finite Automata (DFA). The assignment includes constructing automata for specific languages, converting NFAs to DFAs, and transforming Mealy machines to Moore machines. It specifies the assignment dates and maximum points available.

Uploaded by

Pranav rajput
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
4 views5 pages

TAFL Assignment-1

The document outlines an assignment for the Theory of Automata & Formal Languages course for B.TECH CSE students, detailing various tasks related to Non Deterministic Finite Automata (NFA) and Deterministic Finite Automata (DFA). The assignment includes constructing automata for specific languages, converting NFAs to DFAs, and transforming Mealy machines to Moore machines. It specifies the assignment dates and maximum points available.

Uploaded by

Pranav rajput
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/ 5

Theory of Automata & Formal Languages SESSION: 2023-24

(ACSE0404)
CLASS/SEM: B.TECH CSE( IV
UNIT-I
C)
Assignment Given Date: 19/02/2024 Maximum Points: 30
Assignment Submission Date: 22/02/2024
Faculty Name: -Rohit Chaudhary

BLOOM’S
Q. No. Question Statement Pts CO KNOWLED
GE LEVEL
1 Construct a Non Deterministic Finite Automation (NFA) for 2 1 K5
the language L which accepts all the strings in
which the third symbol from right end is always 'a' over  =
{a, b}.
2 Design the DFA that accepts an even number of a’s and even 2 1 K5
number of b’s.

3 Construct DFA for the following: 2 1 K5

 L={w/w has both an even number of 0’ s and even number


of 1’ s }

 L= { w/w is in the form of “x01y” for some strings x and y


consisting of 0’ s And 1 ‘s}.

4 a. Design Finite Automata that accepts set of strings where the 2 1 K5


number of 0’s in every string is multiple of three over
alphabet {0,1}.

b. Design Finite Automata that accepts set of strings containing


exactly four 1’s in every string over alphabet {0,1}.

c. Design Finite Automata that accepts strings containing


exactly 1 over over alphabet {0,1}

d. Design Deterministic Finite Automata for the language L =


{w : na = 1, w ε (a,b)*}
5 Construct deterministic finite automata (DFAs) recognizing the 2 1 K5
following languages over the alphabet {a, b}:

(a) {a i b j | i ≥ 0, j ≥ 0, i + j is an even number}

(b) The set of all strings that begin with a but do not contain aab as a
substring.

6 Convert the given NFA to DFA. 2 1 K5

7 Convert NFA into DFA. 2 1 K5

8 Convert the given NFA to DFA. 2 1 K5

9 NFA to DFA conversion. 2 1 K4


10 Convert epsilon-NFA to NFA without epsilon. 2 1 K5

11 Construct the minimum state automata equivalent to DFA 2 1 K5


described by Figure:

12 Construct a minimal state finite automaton to the following state 2 1 K5


diagram:
13 Convert the given Mealy machine as shown in Figure into 2 1 K4
Moore Machine.

14 Convert the given Moore machine into its equivalent Mealy machine 2 1 K4

15 Convert the following Mealy machine into equivalent Moore 2 1 K4


machine.

You might also like