Prerequisite: Comp. Sci. W3139 and W3203. Computability and models of computation. Regular languages, finite automata, regular grammars, nondeterminism, regular expressions. Context-free languages, push-down automata, context-free grammers, parsing, Turing machines, general grammars, computability, the Chomsky hierarchy, the Church-Turing thesis, other models of computation.
Department: Computer Science(COMS)
Subject: Computer Science(COMS)
School: School of the Arts, Barnard College, Columbia College, School of General Studies, Graduate School of Arts and Sciences, School of International and Public Affairs, Continuing Education and Special Programs
Course ID: 3261