64 573
Assignments Done
Successfully Done
In September 2018

Answer to Question #38962 in Other Math for Sujata Roy

Question #38962
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
Expert's answer

Need a fast expert's response?

Submit order

and get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!


Assignment Expert
17.02.14, 20:07

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!

Sujata Roy
10.02.14, 21:40

Thank you.

Leave a comment

Ask Your question

Privacy policy Terms and Conditions