0 votes 0 votes Let $L1$ be a regular language and $L2=L1^*$. then $L2$ is?? a)always finite language b)always infinite language and regular c)need not be infinite language. d)none Theory of Computation theory-of-computation + – satyam132 asked Mar 30, 2018 • retagged Mar 30, 2018 by Sukanya Das satyam132 216 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 1 votes 1 votes option c ) need not be infinite language. abhishekmehta4u answered Mar 30, 2018 • selected Mar 30, 2018 by satyam132 abhishekmehta4u comment Share Follow See all 0 reply Please log in or register to add a comment.
