Grape

Home

❯

40 Long

❯

lectures

❯

Western SE 3310

❯

Week 3

Week 3

Sep 23, 20251 min read

  • long

Week 3 notes for Western SE 3310 Theoretical Foundations of Software Engineering

Notes SE 3310b .2cm Theoretical Foundations of Software Engineering 1cm Week 3: Equivalence of DFAs and NFAs. Closure Properties of Regular Languages.

Theorem 1: Theorem - All DFAs have an equivalent NFA

Theorem 2: Theorem - All NFAs have an equivalent DFA

By Theorem 1 and Theorem 2, we find that the set of languages recognized by DFAs and NFAs are equivalent, i.e., the regular languages.


Graph View

Created with Quartz v4.5.2 © 2025

  • GitHub
  • LinkedIn