Is it true that a language L is decidable iff L<= EQCFG ? Language EQCFG = {
Posted: Fri May 20, 2022 5:45 pm
Is it true that a language L is decidable iff L<= EQCFG ?
Language EQCFG = {<G,H? | G.H are CFGs,
and L(G)= L(H)}. Justify your answer
Posted: Fri May 20, 2022 5:45 pm
Is it true that a language L is decidable iff L<= EQCFG ?
Language EQCFG = {<G,H? | G.H are CFGs,
and L(G)= L(H)}. Justify your answer
Language EQCFG = {<G,H? | G.H are CFGs,
and L(G)= L(H)}. Justify your answer