CS402 Assignment no 2 Spring 2013 Idea Solution written update
Following are the two FAs, FA1 accepts all words with a double a in them, and FA2 accepts all words ending in b. Build FA3 that accepts all words that have double a or that end in b.
Logic of above statment:
The above statement express as follow
FA1=Accepts All Word With a double a in them
FA2=Accepts All Word ending b
but
FA3=Accepts All Word That have aa or end in b.
Suppose
FA1+FA2=FA3 (using of union of two languages or equivlent)
than,
FA1=aa , FA2=b and FA3=aa or b
So if we replace aa, b and aa or b respectively in FA1,FA2 and FA3
Than aa+b=(aa)(b)
aab=aab
which show that we use Kleen's thereom 3 Mehtod 1( union of two languages ) in which FA3 equivlent to FA1 and FA2
-->
