Search Results
°ä³§°ä·¡Ìý51703. Formal Languages and Computability. 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, and undecidability. Graduate degree credit will not be given for both °ä³§°ä·¡Ìý43203 and °ä³§°ä·¡Ìý51703. Prerequisite: °ä³§°ä·¡Ìý41303 or °ä³§°ä·¡Ìý51303. (Typically offered: Spring)