Teachings‎ > ‎Undergraduate Courses‎ > ‎

CS133 (WFU and WFW) S1 AY2017--2018

e

Announcements

The introduction of suitable abstractions is our only mental aid to reduce the appeal to enumeration, to organize and master complexity. — E. W. Dijkstra
  • 10 Ago 2016: Links to syllabus, academic calendar are now available. First of several slides and required readings (or RR) are now available also.

 Weektopics Slides / Materials
1Introduction,
regular languages and finite automata, regular operations.
Day 1
RR1
Day 2
Day 3
Nondeterministic finite automata,
equivalence of DFA and NFA,
Minimization of states. 
 Day 4
Regular expressions,
equivalence of regular expressions to finite automata.
 
Nonregular languages, Pumping lemma,
Review for exam 1,
EXAM1 (01 September 2017)
 
 5  

  • Syllabus is available HERE.
  • Academic calendar for AY2017--2018 is HERE.