Below are the descriptions of DFA D1, D2, and D3. Convert them to a DFA that recognizes Maj(L(D1), L(D2), L(D3)) D1: states = {a,b,c}
The post DFA majority first appeared on COMPLIANT PAPERS.
Below are the descriptions of DFA D1, D2, and D3.
Convert them to a DFA that recognizes Maj(L(D1), L(D2), L(D3))
D1:
states = {a,b,c}
input_alphabet = {0,1}
start_state = c
accept_states = {b,c}
delta =
a,0 -> c;
a,1 -> c;
b,0 -> a;
b,1 -> c;
c,0 -> b;
c,1 -> a;
D2:
states = {d,e,f}
input_alphabet = {0,1}
start_state = e
accept_states = {d,e}
delta =
d,0 -> e;
d,1 -> e;
e,0 -> f;
e,1 -> f;
f,0 -> d;
f,1 -> d;
D3:
states = {g,h,i}
input_alphabet = {0,1}
start_state = h
accept_states = {h}
delta =
g,0 -> g;
g,1 -> h;
h,0 -> g;
h,1 -> g;
i,0 -> i;
i,1 -> i;
The post DFA majority first appeared on COMPLIANT PAPERS.
