|
|
|
Apr 25, 2024
|
|
2017-2018 Academic Bulletin [ARCHIVED CATALOG]
|
MATH 310 - Theory of Computation and Formal Languages(also listed as CMPSC 230 )
Credits: 4
An introduction to the theories of finite-state machines, pushdown automata and Turing machines as well as the relation between automata and the formal languages they recognize. Students explore computational theory and its practical applications in lexical analysis and language parsing.
Prerequisite: MATH 205 with a grade of C or better and CMPSC 112 , or permission of instructor.
Distribution Requirements: QR, SP.
|
|
|