710 views

1 Answer

1 votes
1 votes
Equality and completeness problem for DCFL: Decidable

Equality and completeness problem for CFL: undecidable
https://gatecse.in/grammar-decidable-and-undecidable-problems/

Related questions

0 votes
0 votes
0 answers
1
baofbuiafbi asked Nov 14, 2023
151 views
Prove the language L={(G,H)|G is a CFG, H is a DFA, and L(G)∩L(H)=∅} is undecidable.