Question: Problem 3 Define nor operation for the language as follows nor(L1, L2 ={w : w E L1 or w E L2 Show that the family

Problem 3 Define nor operation for the language as follows nor(L1, L2 ={w : w E L1 or w E L2 Show that the family of regular languages is closed under the nor operation. Problem 4 Suppose L1 U L2 is regular and L1 is finite. Show that L2 is regular Hint: you might want to express L2 as a combination of set operations over L U L2 and L
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
