Which of the following statements is false?
The Halting Problem of Turing machines is undecidable
Determining whether a context-free grammar is ambiguous is undecidable
Given two arbitrary context-free grammars $G_1$ and $G_2$ it is undecidable whether $L(G_1) = L(G_2)$
Given two regular grammars $G_1$ and $G_2$ it is undecidable whether $L(G_1) = L(G_2)$
Click for Video Solution
Answer is D.
Equivalence of Regular languages is decidable.
All are decidable for Regular languages.
First $3$ for CFL.
Only $1$st for CSL and REC.
None for RE.
A) halting problem of turing machine are undecidable.
B) Ambiguty problem of CFG are undecidable
C) equvalance problem of CFG is undecidable
d) equvalance problem of regular grammar is decidable
so option d is correct option