Answer on Other Math Question for Sujata Roy

2014-02-06T19:23:57-0500

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 numbersgreater than 5 (i.e. 8, 13, 21, . . . .)(C) L3 = Kleene closure of the language in option (B)(D) None of these