Section outline

  • October 27th, Friday (12:30-14:30)

    Properties of regular languages

    • Closure of regular languages under homomorphism application
    • Time complexity for standard conversions
    • Emptiness test for regular languages
    • Membership test for regular languages
    • Definition of equivalence for states of DFA
    • Equivalence test on states for DFA

    Research & application highlights

    • Regular expressions

    References

    • Hopcroft et al., chapter 4