|
Nov 23, 2024
|
|
|
|
CS 3110 - Formal Languages and Automata (3) Finite automata. Non-determinism. Regular expressions and languages. Context-free grammars and push down automata. Ambiguity. Closure properties. Normal forms. Context-free and non-context-free languages.
Prerequisite(s): CS major, and C or better in CS 241 or CS 2400 . Component(s): Lecture Grading Basis: Graded Only Repeat for Credit: May be taken only once Course Category: Major Course
Add to Portfolio (opens a new window)
|
|