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?
- L1 only
- L3 only
- L1 and L2
- L2 and L3 THE ABOVE LANGUAGE HAS EPLSILON SO ITS NOT RECOGONIZED BY ANY TURING MACHINE HENCE IS IT NOT RECURSIVELY ENUMERABLE??