You can test your stuff here:

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

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

Below is a description of a DFA.

Convert it to a NFA N such that L(N) = L(D)^R.

states = {a,b,c,d}

input_alphabet = {0,1}

start_state = a

accept_states = {b,c}

delta =

a,0 -> d;

a,1 -> b;

b,0 -> c;

b,1 -> d;

c,0 -> c;

c,1 -> d;

d,0 -> a;

d,1 -> c;