code: public static <State,A> NFA<State,A> create(final State startState,
  						final Collection<State> acceptStates,
  						final LabeledForwardNavigator<State,A> lFwdNav) {
  	return new AbstrSimpleNFA<State,A>(startState, acceptStates) {
  	    public LabeledForwardNavigator<State,A> getLabeledForwardNavigator() {
  		return lFwdNav;
  	    }
  	};
      }
docs: Returns a freshly constructed <code>NFA</code>.
  
  @param startState Starting state for the automaton.
  
  @param acceptStates Accepting states for the automaton.  An
  input string (=list) of <code>A</code>s is accepted iff it can
  lead the <code>NFA</code> from the starting state into one of
  these states.
  
  @param lFwdNav Forward navigator that defines the outgoing
  transitions for each automaton state.  We can have multiple
  transitions with the same label out of a state; we can also
  have <code>null</code>-labeled transitions, modeling
  "epsilon"-transitions from classic NFA theory (transitions
  that don't consume any input symbol).  If necessary, the
  <code>NFA</code> will compute a full, bi-directional
  navigator.