...
Question 5926 – UGC NET CS 2009-June-Paper-2
March 7, 2024
Question 10274 – Data-Structures
March 8, 2024
Question 5926 – UGC NET CS 2009-June-Paper-2
March 7, 2024
Question 10274 – Data-Structures
March 8, 2024

Question 10294 – Theory-of-Computation

The regular expression for the language recognized by the finite state automaton of figure is __________

Correct Answer: A

Question 3 Explanation: 
L = 0*1*
L contains all binary strings where a 1 is not followed by a 0.
A
L = 0*1*
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!!