CSCE 51703 — Formal Languages and Computability
Finite Automata and regular languages, regular expressions, context-free languages and pushdown automata, nondeterminism, grammars, and Turing machines. Church's thesis, halting problem, and undecidability. Graduate degree credit will not be given for both CSCE 43203 and CSCE 51703 . Prerequisite: CSCE 41303 or CSCE 51303 . (Typically offered: Spring)
Prerequisites: CSCE 41303, CSCE 51303