1,211 views
0 votes
0 votes

L={ ambn|m <=2n+5}

1 Answer

Best answer
7 votes
7 votes
Language is DCFL but not Regular.
It is DCFL so it must be NCFL, CSL, REC, RE too .
selected by

Related questions

3.2k
views
2 answers
7 votes
Manu Thakur asked Nov 15, 2014
3,195 views
Which of the following is true for the given language?$L=$ {<TM | TM halts on every input}<TM is encoding of the Turing machine(A) $L$ is Recursive and $\overline{L}$ is ...
3.0k
views
2 answers
10 votes
Mahesha999 asked Dec 25, 2016
2,986 views
Consider the following statements:$L_1=\left\{\text{wxw$^R$|w$\in$(a,b)$^*$, x$\in$c }\right\}$$L_2=\left\{\text{wy|w, y $\in$ (a,b)$^*$}\right\} $$L_3=\left\{\text{zwz|w...
652
views
1 answers
1 votes
amaity asked Nov 14, 2017
652 views
Is there any alternate ways to identify if a language is regular/contex-free/context-sensitive etc. from the first sight. (Without using Pumping lemma/Myhill–Nerode the...
2.4k
views
2 answers
3 votes
Sandeep Verma asked Nov 12, 2017
2,414 views
If a language(L1) is Recursive enumerable (RE) and L2 is Recursive (REC) , then what will be L1 - L2 ? Can we directly use set difference property or do the s...