Sunnidhya Roy
asked
Dec 12, 2022
708
views
L = {0^n 1^2n 0^n+m , n,m>=0}Is this Language CFL or non CFL?According to mewe can write this as 0^n 1^n 1^n 0^n 0^mThen we will keep on ... and when we reach the end of the string we simply move to the final state.Is this logic correct?