Theory-of-Computation
December 6, 2023
Theory-of-Computation
December 6, 2023
Theory-of-Computation
December 6, 2023
Theory-of-Computation
December 6, 2023

Theory-of-Computation

Question 38

Which one of the following regular expressions over {0,1} denotes the set of all strings not containing 100 as a substring?

A
0*(1+0)*
B
0*1010*
C
0*1*01
D
0(10+1)*
Question 38 Explanation: 
(A) generates 100.
(B) generates 100 as substring.
(C) doesn’t generate 1.
(D) answer.
Correct Answer: D
Question 38 Explanation: 
(A) generates 100.
(B) generates 100 as substring.
(C) doesn’t generate 1.
(D) answer.
0 0 votes
Article Rating
Subscribe
Notify of
0 Comments
Inline Feedbacks
View all comments
0
Would love your thoughts, please comment.x
()
x
error: Alert: Content selection is disabled!!