Nondeterminism – Introduction
Nondeterminism – Introduction. Lecture 8 Section 1.2 Fri, Sep 7, 2007. Determinism. A finite automaton is deterministic because every move is forced. That is, is a function . For every pair ( q , x ) Q , there is exactly one q Q such that ( q , x ) = q.
483 views • 11 slides