1. True or False. [5 points each (a) The intersection of any two regular languages is regular. (b)If L is any regular language, define PREF(L) to be the set of all prefixes of strings in L. (A prefix of a string u is a substring consisting of the first k symbols of w for some k.) Then PREF(L) is regular. (c) (d) Every subset of a regular language is regular. If h is a homomorphism
PayPal Gateway not configured
PayPal Gateway not configured