Università degli Studi di Udine · A.A. 2025–2026
Verification and Validation Techniques
Lecture notes and interactive companions for the Verification and Validation Techniques course.
Covers finite-state automata, NFA-to-DFA subset construction, ε-closure and ε-removal, product automata, and reachability fixpoint algorithms. Each topic pairs an interactive notebook with the complete lecture notes available as a downloadable PDF.
Course Materials
NB 1
Finite-State Automata
Alphabets, words, languages, and DFAs — hands-on interactive intro
NB 2
NFA Reachable States
Step through the blackboard NFA example and trace active state sets
NB 3
Subset Construction
Convert any NFA to an equivalent DFA step by step
NB 4
ε-Closure & ε-Removal
Compute epsilon-closures and remove ε-transitions from NFAs
NB 5
Product Automaton
Construct the intersection of two DFAs via the product construction
NB 6
Reachability Fixpoint
Compute reachable states with a fixpoint algorithm; explore decision problems
NB 7
Kleene State Elimination
Convert any DFA to a regular expression via state elimination (Kleene's theorem)
PDF
Full Lecture Notes
Download or read the complete lecture notes PDF
Verification & Validation
UniUD
Runs completely in-browser via Pyodide