Consider the regular expression R = (a + b)* (aa + bb) (a + b)* Which…

PYQ GATE 2007

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 181 students.

Sign up free to check your answer

Sign up free

Explore the full course: Theory Of Computation

Loading lesson…