119) Which of the following regular expressions denotes a language comprising all possible strings of even length over the alphabet( 0 , 1 )?
Answer is:
(00 01 1 10)*
Related Theory of Computation MCQ with Answers
Answer is:
both 1) with zero or more instances of a or b and 2) equal to regular expression (a* b*)*
Answer is:
cognitive, generative
Answer is: