Sunday, March 24, 2019
Home > Theory Of Computation > E-closure – Theory Of Computation Pdf

E-closure – Theory Of Computation Pdf

E-closure – Theory Of Computation Pdf – ε-Closure – If ‘q’ Is Any State In ε-NFA Set Of All The State Which Are At ‘0’ Distance From State ‘q’ Is Called As Closure Of (q)

(or)

The Set Of All The State That Can Reach From State ‘q’ Of ε Is Called As ε-Closure Of (q)

Note:- Every State Is Zero Distance From Itself

 

Example 1:-

ε-Closure(q0) -{q0,q1}

ε-Closure(q1)-{q1}

ε-Closure(q2)-{q2}

ε-Closure(q3)-{q3,q1,q2}

 

 

 

 

Leave a Reply

Your email address will not be published. Required fields are marked *