CSCE 43203 — Formal Languages and Computability

3 credits · 3 hours

Finite Automata and regular languages, regular expressions, context-free languages and pushdown automata, nondeterminism, grammars, and Turing machines. Church's thesis, halting problem, time complexity, space complexity and undecidability. Prerequisite: ( CSCE 31903 or CSCE 319H3 , each with a grade of C or better) and ( MATH 26103 or MATH 28003 ). (Typically offered: Spring)

Prerequisites: CSCE 31903, MATH 26103, MATH 28003

Part of

• Computer Science and Computer Engineering (CSCE)
• Electrical Engineering and Computer Science (EECS)
• Data Science (DTSC)

Source ↗

← back to uark catalog