Notes on Cambridge Maths

Something looks off?

The button will add this page to my log of things to fix. Use it for broken links, equations not rendering correctly, etc.
Submit other issues on GitHub.

Nondeterministic Automata

A tople is called nondeterministic automaton if

  1. is a finite set of states
  2. is a start state
  3. accept states
  4. (to the powerset of )

Define recursively:

Then

Something looks off?

The button will add this page to my log of things to fix. Use it for broken links, equations not rendering correctly, etc.
Submit other issues on GitHub.

Graph View

Backlinks