Package recognizer
source code
This package defines a deterministic finite-state recognizer in the
recognizer module. No ε-transitions are allowed.
This package also defines a complementation function in the
complementation module. The complement machine of a machine M1 with
language L recognizes the complement of L. If the alphabet is Σ
then the complement set is Σ* - L.
- recognizer.complementation: Given a machine
machine which recognizes a regular
language L, return another machine,
complement, which recognizes the complement of L.
- recognizer.recognizer: This module defines a deterministic finite-state recognizer.
|