Which of the following statements are true? Argue each answer informally.
a) Any subset of a regular language is itself a regular language.
b) Any superset of a regular language is itself a regular language.
c) The set of anagrams of strings from a regular language forms a regular language.
(An anagram of a string is obtained by rearranging the order of characters in the
string, but without adding or deleting any. The anagrams of the string abc are
hence abc, acb, bac, bca, cab and cba.)
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here