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.

CIS 3211

Automata, Computability, and Languages

Temple University 3 credits CIS

Course Description

This course is not offered every year.Finite automata, their limitations and capabilities, and Kleen's theorem or regular expressions. Other types of automata and their events. Turing machine and computability, computable functions, and halting problems. Introduction to context-free languages. Syntactical analysis of such languages with application to translation. NOTE: For Computer Science Majors.For any CIS prerequisite course taken prior to Spring 2012 a grade of C or better is required.

Code
CIS 3211
Credits
3
Subject
CIS

Programs That Include This Course

Get expert help with CIS 3211 Automata, Computability, and Languages

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