I've found a argument to generate counter examples that show it's not necessary that A = B.
Let C be a language that's union of two languages A1 and A2. Now we construct a DFA M that recognizes the union language.
We'll see that M also recognizes A1 and A2 separately, yet clearly A1 is not necessarily equal to C (A1 is a subset of C).
Similarly, A1 is not equal to A2.
CC: @shakil_tcs
GNU social JP is a social network, courtesy of GNU social JP管理人. It runs on GNU social, version 2.0.2-dev, available under the GNU Affero General Public License.
All GNU social JP content and data are available under the Creative Commons Attribution 3.0 license.