Regular Expressions
9:00
Question 1 of 9
The regular expression for the language accepting all strings containing an even number of 'a's over the alphabet {a, b} is: [GATE CS 2005]
(b*ab*a)*b*
b*(ab*a)*b*
b*(a*b*a*b*)*
b*(ab*ab*)*
Question 1 of 9
The regular expression for the language accepting all strings containing an even number of 'a's over the alphabet {a, b} is: [GATE CS 2005]