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.

CSE 3502

Theory of Computation

University of Connecticut 3 credits CSE

Course Description

Formal models of computation, such as finite state automata, pushdown automata, and Turing machines, and their corresponding elements in formal languages (regular, context-free, recursively enumerable). The complexity hierarchy. Church's thesis and undecidability. NP completeness. Theoretical basis of design and compiler construction. Enrollment Requirements: CSE 2050 or CSE 2100; CSE 2500; open only to students in the College of Engineering, Cognitive Science majors, and declared Computer Science or Cognitive Science minors.

Code
CSE 3502
Credits
3
Subject
CSE

Programs That Include This Course

Get expert help with CSE 3502 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