Question 6307 – CHENNAI MATHEMATICAL INSTITUTE M.Sc. / Ph.D. Programme in Computer Science (15 May 2018)
February 4, 2024Database-Management-System
February 4, 2024ISRO CS-2023
|
Question 13
|
Consider the deterministic finite-state automaton (DEA) below. The alphabet is {a,b}. The state with a small incoming arrow is the initial state, while the double circle state denotes a final state.
Which of the following regular expressions defines the language accepted by the DFA?
Which of the following regular expressions defines the language accepted by the DFA?
|
ab*
|
|
|
a*b*
|
|
|
(ab)*
|
|
|
a*b
|
Correct Answer: A