Home Back

GATE Computer Science (CS) 2022 Shift 1 Solved Paper

© examsiri.com
Question : 12 of 65
 
Marks: +1, -0
Which one of the following regular expressions correctly represents the language of the finite automaton given below?

Validate
Go to Question:
Prev Question
Next Question