Languages and Automata

• Alphabets and Languages
• Finite Representations of Languages
• Deterministic Finite Automata
• Nondeterministic Finite Automata

Languages and Automata Continued

• Finite Automata and Regular Expressions
• Showing Languages are Non-Regular
• Minimizing Finite Automata

Context-free Grammars and Push-down Automata

• Context-Free Grammars
• Parse Trees
• Push-down Automata
• Push-down Automata and Context-free languages

Context-free Languages

• Languages that Are and Are Not Context-free
• Algorithms for Context-free languages

Determinism and Turing Machines

• Determinism and Parsing
• Turing Machines
• Acceptance, Rejection, and I/O for Turing Machines
• Turing Machine extensions: Nondeterminism

Determinism and Turing Machines

• Determinism and Parsing
• Turing Machines
• Acceptance, Rejection, and I/O for Turing Machines
• Turing Machine extensions: Nondeterminism

NO CLASS

Determinism and Turing Machines

• Determinism and Parsing
• Turing Machines
• Acceptance, Rejection, and I/O for Turing Machines
• Turing Machine extensions: Nondeterminism