Scribd
Upload
19 views

Automata Theory

This document summarizes an automata theory lecture about converting nondeterministic finite automata (NFAs) to deterministic finite automata (DFAs). It recaps basic NFA concepts and notation. The lecture objective is to show that NFAs and DFAs are equal in power by eliminating the nondeterminism in NFAs through two methods: 1) eliminating epsilon transitions by introducing new multiple edges and 2) using a subset construction method to eliminate nondeterminism caused by multiple edges. An exercise is provided to practice converting an NFA with epsilon transitions to a finite automaton.

Uploaded by

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

Automata Theory

This document summarizes an automata theory lecture about converting nondeterministic finite automata (NFAs) to deterministic finite automata (DFAs). It recaps basic NFA concepts and notation. The lecture objective is to show that NFAs and DFAs are equal in power by eliminating the nondeterminism in NFAs through two methods: 1) eliminating epsilon transitions by introducing new multiple edges and 2) using a subset construction method to eliminate nondeterminism caused by multiple edges. An exercise is provided to practice converting an NFA with epsilon transitions to a finite automaton.

Uploaded by

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

Automata Theory

Lecture 10
A little recap
^(q0) = ?
^(v) = ?
^(v, s) = ?

δ∗ (q0, aba) = ?
δ∗(q0, ^) = ?
δ∗(q0, a) = ?
Solution δ∗(q0, ab) = ?
δ∗(q0, aba) = ?
Lecture objective
NFA = DFA
Is DFA = NFA?
Eliminating Nondeterminism
• Causes of Nondeterminism
1. Multiple edges
2. ^ transitions
1. Eliminating ^ transitions
a. If ^ is word in languages then make start state in new model accept state as
well.
b. Eliminate ^ transitions.
c. Introduce new multiple edges.
Eliminating ^ transitions
Eliminating Nondeterminism because of multiple
edges using subset construction method
Exercise - Converting NFA-^ to FA

You might also like