343 views

Please log in or register to answer this question.

Related questions

1 votes
1 votes
1 answer
1
rahul sharma 5 asked Sep 11, 2017
395 views
Identify type of grammer:-S- a | $\epsilon$1. TYPE 02. TYPE 13. TYPE 24. TYPE 3
5 votes
5 votes
2 answers
3
Akanksha Kesarwani asked Dec 13, 2015
5,276 views
Which of the following language is $CFL$?a. $\{a^mb^nc^n\;|\;m!=n\}$b. $\{a^mb^nc^k\;|\;if\,(m=n)\,then\,(n!=k)\}$c. $\{a^mb^nc^k\;|\;m>n\;or\;n<k\}$d. None of these
2 votes
2 votes
3 answers
4
Arjun asked Apr 28, 2016
682 views
Consider$L_1 = \left\{a^nb^nc^md^m \mid m,n \ge 1\right\}$$L_2 = \left\{a^nb^n \mid n \ge1\right\}$$L_3 = \left\{(a+b)^*\right\}$$L_1$ - $L_3$ is(A) Regular (B) CFL but n...