Computability, Automata, and Formal Languages   [Archived Catalog]
2016-2017 Graduate Studies Bulletin (Archived Copy)
   
Print-Friendly Page (opens a new window)

CSCE 755 - Computability, Automata, and Formal Languages

Credits: 3

Formal models of computation, including finite state automata, Turing machines, recursive functions, formal grammars, and abstract complexity theory.

Prerequisites: CSCE 355 or 551



Print-Friendly Page (opens a new window)
Close Window
   
All bulletins © 2024 Columbia Campus.
Powered by the Acalog™ Academic Catalog Management System™ (ACMS™).

Mobile Site.