100% Plagiarism-Free
+1-727-416-5453

Sign In

Access your dashboard and order activity.

Forgot password?

Create Account

Register to place orders and track every step.

CS-GY 6753

Theory of Computation

New York University 3 credits Computer Science

Course Description

This course introduces the theory of computation. Topics: Formal languages and automata theory. Deterministic and non-deterministic finite automata, regular expressions, regular languages, context-free languages. Pumping theorems for regular and context-free languages. Turing machines, recognizable and decidable languages. Limits of computability: the Halting Problem, undecidable and unrecognizable languages, reductions to prove undecidability. Time complexity, P and NP, Cook-Levin theorem, NP completeness. | Prerequisites: Graduate standing and CS-GY 6003 (or instructor’s permission). | Knowledge of discrete math (equivalent to CS-GY 6003). Prerequisite: Graduate Standing. Prerequisites: Graduate standing.

Code
CS-GY 6753
Credits
3
Subject
Computer Science

Programs That Include This Course

Get expert help with CS-GY 6753 Theory of Computation

Our subject experts help with essays, research papers, case studies, discussion posts, and capstone projects for these programs — written from scratch to your course requirements.

Get Help Now

Program and course information is reproduced from each university's published academic catalog for informational purposes and may change. Always confirm current requirements with your university. We are an independent academic support service and are not affiliated with or endorsed by the universities listed.

Academic Resources

Latest from the Blog

Expert guides on essay writing, citation styles, study skills, and academic success.

View All Articles