A deterministic finite automation 'F' is given in the image. having 'start‘ state and accepting state (S).
Select the regular expression from the following options that denotes the set of all words accepted by
‘F'-
Correct Answer:
(011 )* 011
Explanation:
Note: This Question is unanswered, help us to find answer for this one
More Computer Science MCQ Questions