Graph Theory Project Documentation¶

A Python programme that can build a non-deterministic finite automaton (NFA) from a regular expression, and can use the NFA to check if the regular expression matches a given string of text.

Indices and tables¶

• Index
• Module Index
• Search Page