CSCI 5510 — Automata, Languages, Computability

Regular and context-free languages, pushdown and finite-state automata, Turing machines, models of computation, halting problems. Students are expected to have knowledge of algorithms equivalent to CSCI 3720 .

Part of

• Common Course Numbering Crosswalk
• CSCI-COMPUTER SCIENCE

Source ↗

← back to donaana catalog