Question: For the alphabet = {a, b, c}, let language A be the set of all strings that contain at least one of each alphabet symbols.
For the alphabet = {a, b, c}, let language A be the set of all strings that contain at least one of each alphabet symbols.
(a) Prove that this language is regular.
(b) Prove that there is a subset B of this language (i.e., B A) that is not regular
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
