460 views
1 votes
1 votes
Can we prove a language is Non-CFL using Diagonalisation ? If yes then how ?

1 Answer

0 votes
0 votes

I THINK

Application of diagnalization is to proof Uncountableity of set not for Checking  NCFL 

Related questions

0 votes
0 votes
0 answers
3
ankitgupta.1729 asked Mar 21, 2018
1,251 views
How DFS(Depth First Search) modification is used to find whether a graph is planar or not ?
5 votes
5 votes
0 answers
4
Mk Utkarsh asked Jan 8, 2018
990 views
How many n length base 10 numbers are there with at least 3 zeros?