The regular expression defining the language L1 U L2 can be-04826
The regular expression defining the language L1 U L2 can be obtained, converting and reducing the previous __________ into a __________ as after eliminating states.
This multiple choice question (MCQ) is related to the book/course
vu cs402 Theory of Automata.
It can also be found in
vu cs402 Mid Term - Quiz No.4.
