User Tools

Site Tools


This is an old revision of the document!

Lecture 7

Lecture 7 Slides

This lecture is about two important conversions: from regular expressions to non-deterministic finite automata (NFA) and from NFA to DFA.


  • Tiger Book Chapter 2 (Specifically 2.4)
cc17/lecture_7.1486404398.txt.gz · Last modified: 2017/02/06 13:06 by hossein