Given L1={0^m 1 0^n/m, n>=1}
L2={1^n 0 1^m/n, m=1}
Construct a NDFA accepting all Strings in {0,1} of L1 U L2
Where u denotes the Union Of
Does L2 really consist of one word?
Anyway, can you write DFAs for L1 and L2 separately? If so, then add a new starting state and epsilon-transitions (that don't accept characters) to those DFAs.
P.S. Questions about formal languages should be posted to Discrete Math forum.