1 / 2

Following the process explained in class, convert the following NFA into DFA.

Take Home Question 1. Following the process explained in class, convert the following NFA into DFA. Carry out the following steps to complete your answer. Step1: Complete the transition table  N for the NFA. Step2 . From  N  construct  D , transition table for the DFA.

casper
Download Presentation

Following the process explained in class, convert the following NFA into DFA.

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Take Home Question 1 Following the process explained in class, convert the following NFA into DFA. Carry out the following steps to complete your answer. Step1: Complete the transition table Nfor the NFA. Step2. From N  construct D, transition table for the DFA. This process consists of several steps and terminates when you cannot add any more rows to the transition table D. Step3: Sketch the DFA.

  2. Take Home Question 2 Find a min-state dfa for the following language L = {an: n mod 3 =0} {an: n mod 5 =1} Take Home Question 3 Minimize the states in the dfa given in the following DFA.

More Related