Finite Automata

• Nondeterministic finite automaton (NFA) NFA = (S,T,s0,F)

  • S: a set of states
  • T: a transition function
  • s0: the start state
  • F: final states or accepting states

Previous slide

Next slide

Back to first slide

View graphic version