 | Select the desired Level or Schedule Type to find available classes for the course. |
| CS 3350 - Automata/Computabi/Formal Lang |
|
Automata, Computability and Formal Languages (3-0)
Theoretical computing models and the formal languages they
characterize: finite state machines, regular expressions,
pushdown automata, context-free grammars, Turing
machines and computability. Capabilities and limitations of
each model, and applications including lexical analysis and
parsing.
Restricted to majors: CS, EECE
Prerequisite: CS 2302 with a grade of "C" or better AND
MATH 2300 w/a grade of C or better.
3.000 Credit hours 3.000 Lecture hours 0.000 Lab hours 0.000 Other hours Levels: Undergraduate Schedule Types: Lecture (LECT) Course Fee(s): None. Computer Science Department Restrictions: Must be enrolled in one of the following Majors: Computer Science Computer Engineering Must be enrolled in one of the following Campuses: Main Campus Prerequisites: Prerequisites for CS 3350 General Requirements: ( Course or Test: CS 2402 Minimum Grade of C May not be taken concurrently. ) or ( Course or Test: CS 2302 Minimum Grade of C May not be taken concurrently. and Course or Test: MATH 2300 Minimum Grade of C May not be taken concurrently. ) |
| Return to Previous | New Search |
 |