Computer Engineering & Computer Science (CECS)
CECS 519./419. Theory of Computation (3)
Prerequisite: CECS 328.
Finite Automata and regular expressions. Pushdown automata and context-free languages. Turing machines and computability. Computational complexity. Additional projects required for CECS 519.
(Lecture-problems 3 hours.) Letter grade only (A-F).
View the course offerings:
Computer Engineering &Computer Science (CECS)
Additional Official Program Information
- Links to CSULB catalog and schedule of classes
*Note: although every effort is made to keep this Web site
up to date, you should also consult the printed catalog for official
information and program requirements, which may vary depending on the
year you enter(ed) the program.
CECS Upper Division Courses 300 - 424
CECS Upper Division Courses 428 - 497