edited by
4,638 views

1 Answer

2 votes
2 votes

1. ambnck; no relation given among m,n,k so it is regular. and Hence DCFL

2. ambnck; if m is even then we have to compare two times (m=n or n=k) and m=k. So it is Not CFL.

 3. ambnck; if m=n then n=k. after comparing m and n, stack will be empty so we can't compare again n and k. It is Not CFL. 

Related questions

1 votes
1 votes
1 answer
1
Himanshu1 asked Nov 2, 2015
991 views
Give an example of Unambiguous CFL which is not DCFL .
1 votes
1 votes
1 answer
2
1 votes
1 votes
2 answers
3
ggwon asked Dec 29, 2022
701 views
L = {$a^{n+m}b^{n}a^{m} | n,m \geq 0$}Is the above language DCFL or CFL ?