Department of CSE, KITSW U18CS404 THEORY OF COMPUTATION

4CSE1 AY:2022-23
CDT4 - LECTURE SUMMARY

CDT4 4. Non-deterministic finite automata

Topics Covered
A Nondeterministic finite automaton (NFA) has the power to be in several
Motivation
states at once. This ability is often expressed as an ability to “guess” something
about its input.

Lecture Learning Outcomes (LLOs): After completion of this lecture, you should be able to…
LLO1 Construct a NFA whose job is to accept all and only the strings of 0’s and 1’s that end in
On topic 1 01
LLO2 Convert the following Non-Deterministic Finite Automata (NFA) to Deterministic Finite
On topic 2 Automata (DFA)

LLO3
On topic 3

State / Alphabet a b

→q0 *q1, q2 –

*q1 – –

q2 *q1, q2 q2

Convert the following NFA to its equivalent DFA

LLO4 Construct a NFA which accept set of binary strings ending with 1010
On topic 4

CDT4 – Lecture Summary – Key Takeaways

Definitions:
In NDFA, for a particular input symbol, the machine can move to any combination of the states
in the machine. In other words, the exact state to which the machine moves cannot be
determined. Hence, it is called Non-deterministic Automaton. As it has finite number of states,
the machine is called Non-deterministic Finite Machine or Non-deterministic Finite
Automaton.
CDT4 - LECTURE LEVEL PRACTICE PROBLEMS (LLPs) to test the LLOs
To test whether you achieved the learning outcomes of this lecture, you should be able to solve the
following LLPs, in the class itself, after completion of the lecture. Minimum one question / problem
(LLP) is designed to test each expected LLO.

Prepared by: DrM. SUJATHA, Dept of CSE, KITSW Page 1 of 4

Department of CSE, KITSW U18CS404 THEORY OF COMPUTATION
4CSE1 AY:2022-23
CDT4 - LECTURE SUMMARY
1. LLP1 (on LLO1): Construct a NFA whose job is to accept all and only the strings of 0’s and 1’s
that ending in 01

2. LLP2 (on LLO2): Convert the following Non-Deterministic Finite Automata (NFA) to
Deterministic Finite Automata (DFA)

Sol.

3. LLP3 (on LLO3): Convert the following NFA to its equivalent DFA

State / Alphabet a b

→q0 *q1, q2 –

*q1 – –

q2 *q1, q2 q2

Sol.

Prepared by: DrM. SUJATHA, Dept of CSE, KITSW Page 2 of 4

Department of CSE, KITSW U18CS404 THEORY OF COMPUTATION
4CSE1 AY:2022-23
CDT4 - LECTURE SUMMARY

4. LLP4 (on LLO4): Construct a DFA over an alphabet Σ={0,1} that accepts the string ending
with ‘00’

Sol.

Prepared by: DrM. SUJATHA, Dept of CSE, KITSW Page 3 of 4

Department of CSE, KITSW U18CS404 THEORY OF COMPUTATION
4CSE1 AY:2022-23
CDT4 - LECTURE SUMMARY

Additional LLPs: Practice problems for homework

1. LLP1.4 (on LLO1): Design NFA which accepts set of binary strings 1101 as substring.
2. LLP2.4 (on LLO2): Construct the Deterministic Finite Automation equivalent to NFA
M=({q0,q1,q2,q3}, {0,1}, δ, q0,{q3}) where delta is given in table
STATE a B
Q0 Q0,Q1 Q0
Q1 Q2 Q1
Q2 Q3 Q3
Q3 Φ Q2
3. LLP3.4 (on LLO3): Construct a NFA which accept set of binary strings beginning with 1010

4. LLP4.4 (on LLO4): Convert to a DFA the following NFA

0 1
->P Q,S Q
*Q R Q,R
R S P
*S Φ P

Prepared by: DrM. SUJATHA, Dept of CSE, KITSW Page 4 of 4