Enter states (1 character names): Enter input alphabet: Enter Final states (subset of states): What is the start state? enter delta(a,0) = enter delta(a,1) = enter delta(b,0) = enter delta(b,1) = enter delta(c,0) = enter delta(c,1) = enter delta(d,0) = enter delta(d,1) = enter delta(e,0) = enter delta(e,1) = enter delta(f,0) = enter delta(f,1) = enter delta(g,0) = enter delta(g,1) = enter delta(h,0) = enter delta(h,1) = Original Deterministic Finite Automaton is: (Q,S,delta,q0,F) where: Q = {a,b,c,d,e,f,g,h} S = {0,1} F = {d} Start state is a Delta: d(a,0) = b d(a,1) = a d(b,0) = a d(b,1) = c d(c,0) = d d(c,1) = b d(d,0) = d d(d,1) = a d(e,0) = d d(e,1) = f d(f,0) = g d(f,1) = e d(g,0) = f d(g,1) = g d(h,0) = g d(h,1) = d Reduced Deterministic Finite Automaton is: (Q,S,delta,q0,F) where: Q = {ag,bf,ce,d} S = {0,1} F = {d} Start state is ag Delta: d(ag,0) = bf d(ag,1) = ag d(bf,0) = ag d(bf,1) = ce d(ce,0) = d d(ce,1) = bf d(d,0) = d d(d,1) = ag Original Deterministic Finite Automaton is: (Q,S,delta,q0,F) where: Q = {a,b,c,d,e,f,g,h} S = {0,1} F = {d} Start state is a Delta: d(a,0) = b d(a,1) = a d(b,0) = a d(b,1) = c d(c,0) = d d(c,1) = b d(d,0) = d d(d,1) = a d(e,0) = d d(e,1) = f d(f,0) = g d(f,1) = e d(g,0) = f d(g,1) = g d(h,0) = g d(h,1) = d Reduced Deterministic Finite Automaton is: (Q,S,delta,q0,F) where: Q = {ag,bf,ce,d} S = {0,1} F = {d} Start state is ag Delta: d(ag,0) = bf d(ag,1) = ag d(bf,0) = ag d(bf,1) = ce d(ce,0) = d d(ce,1) = bf d(d,0) = d d(d,1) = ag Original Deterministic Finite Automaton is: (Q,S,delta,q0,F) where: Q = {a,b,c,d,e,f,g,h} S = {0,1} F = {d} Start state is a Delta: d(a,0) = b d(a,1) = a d(b,0) = a d(b,1) = c d(c,0) = d d(c,1) = b d(d,0) = d d(d,1) = a d(e,0) = d d(e,1) = f d(f,0) = g d(f,1) = e d(g,0) = f d(g,1) = g d(h,0) = g d(h,1) = d Reduced Deterministic Finite Automaton is: (Q,S,delta,q0,F) where: Q = {ag,bf,ce,d} S = {0,1} F = {d} Start state is ag Delta: d(ag,0) = bf d(ag,1) = ag d(bf,0) = ag d(bf,1) = ce d(ce,0) = d d(ce,1) = bf d(d,0) = d d(d,1) = ag Original Deterministic Finite Automaton is: (Q,S,delta,q0,F) where: Q = {a,b,c,d,e,f,g,h} S = {0,1} F = {d} Start state is a Delta: d(a,0) = b d(a,1) = a d(b,0) = a d(b,1) = c d(c,0) = d d(c,1) = b d(d,0) = d d(d,1) = a d(e,0) = d d(e,1) = f d(f,0) = g d(f,1) = e d(g,0) = f d(g,1) = g d(h,0) = g d(h,1) = d Reduced Deterministic Finite Automaton is: (Q,S,delta,q0,F) where: Q = {ag,bf,ce,d} S = {0,1} F = {d} Start state is ag Delta: d(ag,0) = bf d(ag,1) = ag d(bf,0) = ag d(bf,1) = ce d(ce,0) = d d(ce,1) = bf d(d,0) = d d(d,1) = ag Original Deterministic Finite Automaton is: (Q,S,delta,q0,F) where: Q = {a,b,c,d,e,f,g,h} S = {0,1} F = {d} Start state is a Delta: d(a,0) = b d(a,1) = a d(b,0) = a d(b,1) = c d(c,0) = d d(c,1) = b d(d,0) = d d(d,1) = a d(e,0) = d d(e,1) = f d(f,0) = g d(f,1) = e d(g,0) = f d(g,1) = g d(h,0) = g d(h,1) = d Reduced Deterministic Finite Automaton is: (Q,S,delta,q0,F) where: Q = {ag,bf,ce,d} S = {0,1} F = {d} Start state is ag Delta: d(ag,0) = bf d(ag,1) = ag d(bf,0) = ag d(bf,1) = ce d(ce,0) = d d(ce,1) = bf d(d,0) = d d(d,1) = ag Original Deterministic Finite Automaton is: (Q,S,delta,q0,F) where: Q = {a,b,c,d,e,f,g,h} S = {0,1} F = {d} Start state is a Delta: d(a,0) = b d(a,1) = a d(b,0) = a d(b,1) = c d(c,0) = d d(c,1) = b d(d,0) = d d(d,1) = a d(e,0) = d d(e,1) = f d(f,0) = g d(f,1) = e d(g,0) = f d(g,1) = g d(h,0) = g d(h,1) = d Reduced Deterministic Finite Automaton is: (Q,S,delta,q0,F) where: Q = {ag,bf,ce,d} S = {0,1} F = {d} Start state is ag Delta: d(ag,0) = bf d(ag,1) = ag d(bf,0) = ag d(bf,1) = ce d(ce,0) = d d(ce,1) = bf d(d,0) = d d(d,1) = ag Original Deterministic Finite Automaton is: (Q,S,delta,q0,F) where: Q = {a,b,c,d,e,f,g,h} S = {0,1} F = {d} Start state is a Delta: d(a,0) = b d(a,1) = a d(b,0) = a d(b,1) = c d(c,0) = d d(c,1) = b d(d,0) = d d(d,1) = a d(e,0) = d d(e,1) = f d(f,0) = g d(f,1) = e d(g,0) = f d(g,1) = g d(h,0) = g d(h,1) = d Reduced Deterministic Finite Automaton is: (Q,S,delta,q0,F) where: Q = {ag,bf,ce,d} S = {0,1} F = {d} Start state is ag Delta: d(ag,0) = bf d(ag,1) = ag d(bf,0) = ag d(bf,1) = ce d(ce,0) = d d(ce,1) = bf d(d,0) = d d(d,1) = ag Original Deterministic Finite Automaton is: (Q,S,delta,q0,F) where: Q = {a,b,c,d,e,f,g,h} S = {0,1} F = {d} Start state is a Delta: d(a,0) = b d(a,1) = a d(b,0) = a d(b,1) = c d(c,0) = d d(c,1) = b d(d,0) = d d(d,1) = a d(e,0) = d d(e,1) = f d(f,0) = g d(f,1) = e d(g,0) = f d(g,1) = g d(h,0) = g d(h,1) = d Reduced Deterministic Finite Automaton is: (Q,S,delta,q0,F) where: Q = {ag,bf,ce,d} S = {0,1} F = {d} Start state is ag Delta: d(ag,0) = bf d(ag,1) = ag d(bf,0) = ag d(bf,1) = ce d(ce,0) = d d(ce,1) = bf d(d,0) = d d(d,1) = ag Original Deterministic Finite Automaton is: (Q,S,delta,q0,F) where: Q = {a,b,c,d,e,f,g,h} S = {0,1} F = {d} Start state is a Delta: d(a,0) = b d(a,1) = a d(b,0) = a d(b,1) = c d(c,0) = d d(c,1) = b d(d,0) = d d(d,1) = a d(e,0) = d d(e,1) = f d(f,0) = g d(f,1) = e d(g,0) = f d(g,1) = g d(h,0) = g d(h,1) = d Reduced Deterministic Finite Automaton is: (Q,S,delta,q0,F) where: Q = {ag,bf,ce,d} S = {0,1} F = {d} Start state is ag Delta: d(ag,0) = bf d(ag,1) = ag d(bf,0) = ag d(bf,1) = ce d(ce,0) = d d(ce,1) = bf d(d,0) = d d(d,1) = ag Original Deterministic Finite Automaton is: (Q,S,delta,q0,F) where: Q = {a,b,c,d,e,f,g,h} S = {0,1} F = {d} Start state is a Delta: d(a,0) = b d(a,1) = a d(b,0) = a d(b,1) = c d(c,0) = d d(c,1) = b d(d,0) = d d(d,1) = a d(e,0) = d d(e,1) = f d(f,0) = g d(f,1) = e d(g,0) = f d(g,1) = g d(h,0) = g d(h,1) = d Reduced Deterministic Finite Automaton is: (Q,S,delta,q0,F) where: Q = {ag,bf,ce,d} S = {0,1} F = {d} Start state is ag Delta: d(ag,0) = bf d(ag,1) = ag d(bf,0) = ag d(bf,1) = ce d(ce,0) = d d(ce,1) = bf d(d,0) = d d(d,1) = ag