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
Is it true that a language L is decidable iff L<= EQCFG ? Language EQCFG = {
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
Is it true that a language L is decidable iff L<= EQCFG ? Language EQCFG = {
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!