Skip to content
This repository has been archived by the owner on Jan 27, 2023. It is now read-only.

CIS 3211

Jump to bottom
Victor Williams edited this page Aug 13, 2020 · 1 revision

CIS 3211. AUTOMATA, COMPUTABILITY, AND LANGUAGES. 3 CREDIT HOURS. 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.

Repeatability: This course may not be repeated for additional credits.

Pre-requisites: CIS 2166|Minimum Grade of C-|May not be taken concurrently.

Clone this wiki locally