Back to Questions
Computer Science Fundamentals Algorithms Objective
Mar 01, 2013

Which of the following regular expressions denotes a language comprising of all possible strings over Σ = {a, b} of length n where n is a multiple of 3.

Choose the correct answer:
A) (a + b + aa + bb + aba + bba)*
B) (aaa + bbb)*
C) ((a + b)(a + b)(a + b))*
D) (aaa + ab + a) + (bbb + bb + a)
Detailed Explanation

Option c is right answer.

Discussion (0)

No comments yet. Be the first to share your thoughts!

Share Your Thoughts
Feedback