product automata: this is from compound aurtomata
example of finite automata accept odd no. of a's and even no. of b's( * indicate final state)
QUE:(q0,q1*)belongs to FA of odd no of a's AND(q2,q3*)belongs to FA of even no. b's
AND:(q0,q1*) * (q2,q3*)=(q0q2,q1q2,q0q3,q1*q3*)
QUE:(q0,q1*)belongs to FA of odd no of a's OR(q2,q3*)belongs to FA of even no. b's
OR:(q0,q1*) * (q2,q3*)=(q0q2,q1q2*,q0q3*,q1q3*)