|
CS/SE
Course Assessment |
 |
| |
Search: |
|
|
| |
|
|
Course
Numbers |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
CS 4336 |
| |
| |
| |
| |
| |
| |
CS 4386 |
| |
| |
| |
| |
| |
| |
|
Class
Learning Objectives
CS 4384 Automata Theory
Ability to design finite state automata and regular expressions
Ability to convert among DFA, NFA, regular expressions
Ability to show that a language is not regular
Ability to design Push-Down Automata and Context-Free Grammars
Ability to convert PDAs to context free grammars and vice-versa
Ability to show that a language is not context free.
|
|
|
|
|
|