478 views
2 votes
2 votes
G1 and G2 are DCFL. Is G1 = G2 Decidable or Undecidable?

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
1
aambazinga asked Sep 8, 2018
422 views
How can we say that any two disjoint co-turing recognisable languages are seperable by some Decidability language?
0 votes
0 votes
0 answers
4
daksirp asked Jul 31, 2018
877 views
Consider <M be the encoding of a Turing Machine as a string over alphabet Σ = {0, 1}. Consider L = {<M>⏐M is TM that halt on all input and L(M) = L′ for some undecid...