Given two FSA M1 and M2, we want a FSA M which recognises a string exactly when either M1 or M2 (or both) recognise it.
Refer to the examples in the sections referred to above for examples of the individual steps.
Construct a FSA which recognises the union of the languages generated by the following FSA: