convert NFA to DFA

You will be given a NFA N, described using the text file format for the NFA simulator. Convert it to a DFA recognizing L(N) using the procedure described in lecture (the subset construction).

You can test your stuff here:

http://web.cs.ucdavis.edu/~doty/automata/simulator.html

=================

Below is a description of an NFA N.

Convert it to a DFA recognizing L(N).

=================

states = {a,b,c}

input_alphabet = {0,1}

start_state = c

accept_states = {b}

delta =

a, -> b;

a,0 -> c;

b, -> c;

b,1 -> a;

c,0 -> {b,c};