edited by
1,231 views
1 votes
1 votes
Given two deterministic CFG G$_1$  and G$_2$, is L( G$_1$ ) = L( G$_2$ ) ?
edited by

3 Answers

0 votes
0 votes

Answer is Decidable in case of Deterministic CFL.

But if we talk in wider context that is of CFL (Deterministic and non deterministic combined ) , this becomes Undecidable.

Related questions

0 votes
0 votes
0 answers
1
Shamim Ahmed asked Nov 1, 2018
493 views
Given two deterministic CFG G$_1$ and G$_2$ , is L(G$_1$) ∩ L(G$_2$) = ∅ ?
1 votes
1 votes
2 answers
2
1 votes
1 votes
1 answer
3
learner_geek asked Aug 15, 2017
1,374 views
Is complement of language same type or not decidable by CFL and recursive language or not???Grammar is ambiguous or not?Grammar in regular/CFL/rel decidable or not?
4 votes
4 votes
3 answers
4
Xylene asked Jul 14, 2017
1,608 views
Problem :- intersection of 2 CFL's is CFL. Is this decidable ?