Scribd
Upload
30 views

Theory of Computation (CS F351) : BITS Pilani

This document contains lecture slides about state minimization in finite automata from Prof. R. Gururaj of the CS&IS Department at BITS Pilani Hyderabad Campus. It discusses the concepts of equivalence of states, how two states are considered equivalent if the same strings are accepted from either state, and how this equivalence is checked through k-equivalence by examining transitions on strings up to length k. An example of state minimization is provided, showing the original and final minimized DFA.

Uploaded by

avi
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
30 views

Theory of Computation (CS F351) : BITS Pilani

This document contains lecture slides about state minimization in finite automata from Prof. R. Gururaj of the CS&IS Department at BITS Pilani Hyderabad Campus. It discusses the concepts of equivalence of states, how two states are considered equivalent if the same strings are accepted from either state, and how this equivalence is checked through k-equivalence by examining transitions on strings up to length k. An example of state minimization is provided, showing the original and final minimized DFA.

Uploaded by

avi
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 10

Theory of Computation (CS F351)

Prof.R.Gururaj
BITS Pilani CS&IS Dept.
Hyderabad Campus
State Minimization in a Finite
Automata (Sec. 2.5 of T1)
Prof.R.Gururaj
BITS Pilani CS&IS Dept.
Hyderabad Campus
State minimization

Prof.R.Gururaj CSF351 Theory of Computation BITS Pilani, Hyderabad Campus


Prof.R.Gururaj CSF351 Theory of Computation BITS Pilani, Hyderabad Campus
Prof.R.Gururaj CSF351 Theory of Computation BITS Pilani, Hyderabad Campus
Equivalence of two states.

Two states qi and qj are equivalent in a DFA means that-


“ From either state precisely the same strings are accepted.”

Two states qi and qj are equivalent qi ≡ qj if both δ (qi , x) and


δ (qj , x) are final states or non-final states, for all x ϵ∑*

It is difficult to check the result of δ (qi , x) and δ (qj , x) for all x


ϵ∑*.

Two states qi and qj are k-equivalent (k≥0) qi ≡ qj if both δ (qi ,


x) and δ (qj , x) are final states or non-final states, for all x
ϵ∑* with length |x| ≤ k .
Hence any two final states are 0-equivalent.

BITS Pilani, Hyderabad Campus


Example

BITS Pilani, Hyderabad Campus


BITS Pilani, Hyderabad Campus
BITS Pilani, Hyderabad Campus
Final minimal DFA

BITS Pilani, Hyderabad Campus

You might also like