If L1 is regular L2 is unknown but L1-L2 is regular ,then L2 must be
Question
If L1 is regular L2 is unknown but L1-L2 is regular ,then L2 must be
Solution
The language L2 could be either regular or non-regular. The regularity of L1 and L1-L2 does not provide enough information to determine the regularity of L2.
Similar Questions
If L1 is regular L2 is unknown but L1-L2 is regular ,then L2 must be ans.RegularCFGEmpty setDecidableThis Question Is Marked For Review Previous Remove From Review Next
If L1 is regular L2 is unknown but L1-L2 is regular ,then L2 must be ans.CFGEmpty setRegularDecidable
If L1 is regular L2 is unknown but L1-L2 is regular ,then L2 must be ans. Regular CFG Decidable Empty set
In L2 Regularization we find-
Show that L1 = L1L2/L2 is not true for all languages L1 and L2
Upgrade your grade with Knowee
Get personalized homework help. Review tough concepts in more detail, or go deeper into your topic by exploring other relevant questions.