Example We use an example to show that the following language has an

nfa $($assuming $L_1$ and $L_2$ are regular, $ox$ is the bitwise exclusive$-$or

operator$)$

$\{w_{1}ox{w}_2|w_{1}in{L}_1,w_{2}in{L}_1,|w_1|=|w_2|\}$