CECS 329 Lectures

• Undecidability (Annotated Friday)
• Undecidability
• Decidability (Annotated Friday)
• Decidability (Annotated MW)
• Decidability
• Turing Machines (Annotated Friday)
• Turing Machines (Annotated MW)
• Turing Machines
• Context Free Languages (Annotated Friday)
• Context Free Languages (Annotated MW)
• Context Free Languages
• Equivalence Between Regular Languages and Regular Expressions (Annotated Friday)
• Equivalence Between Regular Languages and Regular Expressions (Annotated MW)
• Equivalence Between Regular Languages and Regular Expressions
• Language Operations and Regular Expressions (Annotated Friday)
• Language Operations and Regular Expressions (Annotated MW)
• Language Operations and Regular Expressions
• Nondeterministic Finite Automata (Annotated Friday)
• Nondeterministic Finite Automata (Annotated MW)
• Nondeterministic Finite Automata
• Deterministic Finite Automata (Annotated Friday)
• Deterministic Finite Automata (Annotated MW)
• Deterministic Finite Automata
• Discrete Math Review (Annotated Friday)
• Discrete Math Review (Annotated MW)
• Discrete Math Review