If we have two transition graphs then their union will be-04686
If we have two transition graphs then their union will be expressed by
This multiple choice question (MCQ) is related to the book/course
vu cs402 Theory of Automata.
It can also be found in
vu cs402 Final Term - Quiz No.11.
If we have two transition graphs then their union will be expressed by
taking a common start state and joining them by two null transitions
just connecting both start states by null transitions
connectting final state of first TG to the initial state of second TG
connecting the final state of first TG to the final state of second TG
