249 views
0 votes
0 votes

Let

L1={0n+m1n0m∣n,m≥0}L1={0n+m1n0m∣n,m≥0},

L2={0^n+m 1^n+m 0^m∣n,m≥0}L2={0^n+m 1^n+m 0^m∣n,m≥0} and

L3={0^n+m 1^n+m 0^n+m∣n,m≥0}L3={0^n+m 1^n+m 0^n+m∣n,m≥0}.  

Which of these languages are NOT context free? 

  1. L1 only
  2. L3 only
  3. L1 and L2
  4. L2 and L3   THE ABOVE LANGUAGE HAS EPLSILON SO ITS NOT RECOGONIZED BY ANY TURING MACHINE HENCE IS IT NOT RECURSIVELY ENUMERABLE?? 

Please log in or register to answer this question.

Related questions

0 votes
0 votes
1 answer
1
3 votes
3 votes
1 answer
4
target2017 asked Dec 12, 2016
947 views
Are Gate 2006 questions really tough?I'm hardly able to solve few questions.How should I approach such questions.