Nondeterministic Finite State Automata (NFA)

Purpose

In this chapter, we define and describe an unusual extension to FSAs, the nondeterministic finite state automaton (NFA).

Topics

  1. Background Topics
  2. Formal Definition
  3. Intuitive ideas to supplement the formal definition
  4. Why do we study this unrealistic model of computation?
Table of Contents (up one level)