York University EECS3342/EECS4302
Professor Jackie Wang · York University · 14 lectures with notes
Students in this class: ask your lecturer for the class code, and these lectures will already be in your library when you sign up.
[HD] EECS3342 F26 - 2026-09-10 (Thursday) - Lecture 1
EECS 3342 builds formal modeling and verification skills through discrete math, Event-B, and a bridge-controller case study.
[HD] EECS3342 F26 - 2026-09-15 (Tuesday) - Lecture 2
Java short-circuit evaluation requires correctly ordered guards, while mathematical conjunction checks each expression independently.
[HD] EECS3342 F26 - 2026-09-17 (Thursday) - Lecture 3
Translate implication carefully, then use range-aware quantifiers to reason about universal and existential claims.
[HD] EECS3342 F26 - 2026-09-22 (Tuesday) - Lecture 4
Quantifier proof strategies lead into set comprehension and the derivation of n-choose-i counting.
[HD] EECS3342 F26 - 2026-09-24 (Thursday) - Lecture 5
A relation from S to T is any subset of S × T, connecting Cartesian products directly to power sets.
[HD] EECS3342 F26 - 2026-09-29 (Tuesday) - Lecture 6
Jackie Wang connects power sets to relations and applies formal relational operators before introducing the definition of functions.
[HD] EECS3342 F26 - 2026-10-01 (Thursday) - Lecture 7
Partial functions need only be functional; total functions must also define a value for every element of the source set.
[HD] EECS4302 F26 - 2026-09-10 (Thursday) - Lecture 1
EECS 4302 links automata and parsing theory to a hands-on Java compiler project using ANTLR 4.
[HD] EECS4302 F26 - 2026-09-15 (Tuesday) - Lecture 2
A compiler must preserve meaning across languages, and its design depends on source scope, target expressiveness, and sound software structure.
[HD] EECS4302 F26 - 2026-09-17 (Thursday) - Lecture 3
Cohesion, minimal-change design, and shared intermediate representations help structure maintainable software and compilers.
[HD] EECS4302 F26 - 2026-09-22 (Tuesday) - Lecture 4
A compiler transforms source through tokens and syntax trees, while semantic analysis checks meaning and enables behavior-preserving optimization.
[HD] EECS4302 F26 - 2026-09-24 (Thursday) - Lecture 5
Assignment 1 implements automata transformations in Eclipse, while the lecture builds the formal language concepts behind lexical analysis.
[HD] EECS4302 F26 - 2026-09-29 (Tuesday) - Lecture 6
Jackie Wang connects alphabets, languages, regular expressions, DFAs, and NFAs through concrete binary-string examples for Assignment 1.
[HD] EECS4302 F26 - 2026-10-01 (Thursday) - Lecture 7
How to trace NFAs, compute epsilon-closures, and recursively convert regular expressions into epsilon-NFAs.