Consider the regular expression R = (a + b)* (aa + bb) (a + b)* Which…
GATE · 2007 · IT
Consider the regular expression R = (a + b)* (aa + bb) (a + b)*
Which deterministic finite automaton accepts the language represented by the regular expression R ?
Attempted by 149 students.
Sign up free to check your answer
Sign up freeLoading lesson…