Let L5 be the language { {G,D} | G is a CFG, D is a DFA, and L(D) ⊆ L(G) }
Show that L5 is undecidable. Is L5 R.E.? Is it co-R.E.?
I am not quite sure where exactly to start with this. Could someone help me in proving L5 is undecidable
Let L5 be the language { {G,D} | G is a CFG, D is a DFA, and L(D) ⊆ L(G) }
Show that L5 is undecidable. Is L5 R.E.? Is it co-R.E.?
I am not quite sure where exactly to start with this. Could someone help me in proving L5 is undecidable
Copyright © 2021 JogjaFile Inc.
This was first published by Hopcroft in 1969. See the elegant proof here.