Which of the following is a regular language?
(A) L1 = Set of balanced parenthesis where alphabet sigma={(,)}
(B) L2 = Set of all unary strings |sigma| = 1 of lengths equal to Fibonacci numbers
greater than 5 (i.e. 8, 13, 21, . . . .)
(C) L3 = Kleene closure of the language in option (B)
(D) None of these
Comments
Dear Sujata Roy You're welcome. We are glad to be helpful. If you liked our service please press like-button beside answer field. Thank you!
Thank you.
Leave a comment