Home > Theory Of Computation > NFA Example : Construct The NFA That Accepts All The Strings Of 0 & 1 Where Every String Start And End With 0

NFA Example : Construct The NFA That Accepts All The Strings Of 0 & 1 Where Every String Start And End With 0

Construct The NFA That Accepts All The Strings Of 0 & 1

(i) Where Every String Start And End With 0

(ii) Every String Start & End With Same Symbol

(iii) Every String Start & End With Different Symbol

 

(i) Where Every String Start And End With 0

L={0,00,010,0110,01010….}

 

(ii) Every String Start & End With Same Symbol 

L={00,11,010,101,101101….}

NFA Transition Table

(iii) Every String Start & End With Different Symbol

L={01,10,011……..}

NFA Transition Table

 

8 thoughts on “NFA Example : Construct The NFA That Accepts All The Strings Of 0 & 1 Where Every String Start And End With 0

Leave a Reply

Secured By miniOrange