Legacy Course Catalog
C S 410 - Automata And Computability
Effectivity: | 08/27/2001 - Fall 2007 *** @ Purdue Calumet Traditional |
---|---|
Credits: | 3 |
Instructional Types: | Lec |
Usually Offered: | fal spr sum |
Short Title: | Automat & Computabilty |
Description: | A finite automaton is a mathematical model for a computational system. Computer science embodies many examples of finite state systems. This course will cover the basic principles of deterministic and non-deterministic finite automata, Turing machines, formal language theory, regular expressions, context-free grammers, the halting problem, and unsolvability. |
Department: | Mathematics, Computer Science&Statistics |
Credit By Exam: | NO |
Repeatable Flag: | NO |
Temporary Flag: | NO |
Full Time Privilege Flag: | NO |
Honors Flag: | NO |
Variable Title Flag: | NO |
Fall 2007 *** indicates the course was still an active course and was transferred to the Banner Catalog effective Spring 2008. This course was not expired Fall 2007.