code: func (l *Levenshtein) CanMatch(s int) bool {
  	if s < len(l.dfa.states) && s > 0 {
  		return true
  	}
  	return false
  }
docs: // CanMatch returns if the specified state can ever transition to a matching
  // state.