Hi,
I have a question:
Q. Show that there exist an algorithm for determining if L1 is a subset of L2 , for any regular languages L1 and L2
If L1 is a subset of L2, then according to set equality we have:
L1 is a subset of L2 and L2 is a subset of L1.
Therefore we have an algorithm according to set equality to show that L1 is subset of L2.
https://forum.allaboutcircuits.com/...f-language-l1-is-equal-to-language-l2.164158/
Some body please guide me if my argument is correct or not.
Zulfi.
I have a question:
Q. Show that there exist an algorithm for determining if L1 is a subset of L2 , for any regular languages L1 and L2
If L1 is a subset of L2, then according to set equality we have:
L1 is a subset of L2 and L2 is a subset of L1.
Therefore we have an algorithm according to set equality to show that L1 is subset of L2.
https://forum.allaboutcircuits.com/...f-language-l1-is-equal-to-language-l2.164158/
Some body please guide me if my argument is correct or not.
Zulfi.