Loopless NFA equivalent in strength to NFA For every nondeterministic finite state automata (NFA) that has self-loop(s), there exists an equivalent NFA that does not have any self-loop.

How do I prove this?
Make two copies of your original NFA and connect them in an appropriate way.