(define (nfa-traversal start-state trans-func alphabet)
  ;need to consider epsilon transitions as well
  (define as (set-add alphabet epsilon))

  ;;;The set of states reachable-from one state
  (define (reachable-from state)
    (for/set ([a as])
             (trans-func state a)))

  ;Recursively find all reachable states
  (for/fold ([init (reachable-from start-state)])
    ;;;;;;;;;;;;SOMETHING
    ))