Scribd
Upload
3 views

Assignment 1

The document outlines an assignment for a course on the Theory of Formal Languages and Automata, detailing ten questions that cover fundamental concepts such as alphabets, DFAs, NFAs, and Mealy and Moore machines. Students are required to define terms, design automata, convert between different types of machines, and minimize DFAs. The assignment is to be submitted by May 9, 2025.

Uploaded by

faiz mohammad
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
3 views

Assignment 1

The document outlines an assignment for a course on the Theory of Formal Languages and Automata, detailing ten questions that cover fundamental concepts such as alphabets, DFAs, NFAs, and Mealy and Moore machines. Students are required to define terms, design automata, convert between different types of machines, and minimize DFAs. The assignment is to be submitted by May 9, 2025.

Uploaded by

faiz mohammad
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Assignment 1 (Unit 1)

Subject: Theory of Formal Languages and Automata


Faculty Name: Mr. Faz Mohd.
Course: B. Tech
Section: B2, B3, B4, B5
Submission Date: 09.05.2025

Q1. Define the following terms with suitable examples: Alphabet, Symbol, String, Formal
Language.
Q2. Discuss the equivalence of DFA and NFA. How can any NFA be converted into a DFA?
Q3. Design a DFA over the alphabet {a, b} that accepts all strings ending with "ab".
Q4. Construct an NFA that accepts the language consisting of strings over {0,1} where the
third symbol from the right is '1'.
Q5. Convert the following NFA into an equivalent DFA:
 States: {q0, q1},
 Alphabet: {0,1},
 Start state: q0,
 Accepting state: q1,
 Transitions:
o δ(q0, 0) = {q0},
o δ(q0, 1) = {q0, q1},
o δ(q1, 1) = {q1}
Q6. Construct an ε-NFA for the regular expression (a|b)*abb.
Q7. Eliminate ε-transitions from the following ε-NFA:
 States: {q0, q1, q2},
 Alphabet: {a},
 Start state: q0,
 Accepting state: q2,
 Transitions:
o δ(q0, ε) = {q1},
o δ(q1, ε) = {q2},
o δ(q2, a) = {q2}
Q8. What do you mean by Mealy Machine, explain with example? Differentiate between
Mealy and Moore machine.
Q9. Convert the given Mealy Machine into an equivalent Moore Machine.

Q10. Minimize the following DFA:


 States: {A, B, C, D, E, F},
 Alphabet: {0,1},
 Start state: A,
 Final states: {E, F},
 Transitions:
o δ(A, 0) = B, δ(A, 1) = C
o δ(B, 0) = D, δ(B, 1) = E
o δ(C, 0) = F, δ(C, 1) = D
o δ(D, 0) = D, δ(D, 1) = D
o δ(E, 0) = E, δ(E, 1) = E
o δ(F, 0) = F, δ(F, 1) = F

You might also like